/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --icfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --traceabstraction.dfs.order.used.in.por BY_SERIAL_NUMBER --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL --traceabstraction.commutativity.condition.synthesis NONE -i ../../../trunk/examples/svcomp/pthread/reorder_2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-04aa6ae-m [2025-04-16 03:47:24,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-16 03:47:24,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-16 03:47:24,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-16 03:47:24,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-16 03:47:24,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-16 03:47:24,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-16 03:47:24,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-16 03:47:24,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-16 03:47:24,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-16 03:47:24,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Use SBE=true [2025-04-16 03:47:24,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-16 03:47:24,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-16 03:47:24,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-16 03:47:24,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-16 03:47:24,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-16 03:47:24,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 03:47:24,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 03:47:24,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 03:47:24,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-16 03:47:24,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-16 03:47:24,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-16 03:47:24,133 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-16 03:47:24,133 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-16 03:47:24,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Only consider context switches at boundaries of atomic blocks -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> BY_SERIAL_NUMBER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-04-16 03:47:24,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-16 03:47:24,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-16 03:47:24,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-16 03:47:24,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-16 03:47:24,372 INFO L274 PluginConnector]: CDTParser initialized [2025-04-16 03:47:24,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_2.i [2025-04-16 03:47:25,743 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c31f84b7/f45f3e30f92c4e9e8ca7fab177af1dd4/FLAGb9be9c0ba [2025-04-16 03:47:25,999 INFO L389 CDTParser]: Found 1 translation units. [2025-04-16 03:47:25,999 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_2.i [2025-04-16 03:47:26,012 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c31f84b7/f45f3e30f92c4e9e8ca7fab177af1dd4/FLAGb9be9c0ba [2025-04-16 03:47:26,744 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c31f84b7/f45f3e30f92c4e9e8ca7fab177af1dd4 [2025-04-16 03:47:26,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-16 03:47:26,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-16 03:47:26,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-16 03:47:26,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-16 03:47:26,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-16 03:47:26,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 03:47:26" (1/1) ... [2025-04-16 03:47:26,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfa7e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:26, skipping insertion in model container [2025-04-16 03:47:26,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 03:47:26" (1/1) ... [2025-04-16 03:47:26,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-16 03:47:27,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 03:47:27,130 INFO L200 MainTranslator]: Completed pre-run [2025-04-16 03:47:27,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 03:47:27,248 INFO L204 MainTranslator]: Completed translation [2025-04-16 03:47:27,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27 WrapperNode [2025-04-16 03:47:27,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-16 03:47:27,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-16 03:47:27,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-16 03:47:27,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-16 03:47:27,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,288 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-04-16 03:47:27,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-16 03:47:27,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-16 03:47:27,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-16 03:47:27,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-16 03:47:27,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-16 03:47:27,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-16 03:47:27,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-16 03:47:27,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-16 03:47:27,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (1/1) ... [2025-04-16 03:47:27,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 03:47:27,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 03:47:27,340 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-16 03:47:27,343 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-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-04-16 03:47:27,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-16 03:47:27,362 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-04-16 03:47:27,363 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-04-16 03:47:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-16 03:47:27,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-16 03:47:27,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-16 03:47:27,364 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-16 03:47:27,471 INFO L256 CfgBuilder]: Building ICFG [2025-04-16 03:47:27,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-16 03:47:27,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-04-16 03:47:27,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-04-16 03:47:27,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-04-16 03:47:27,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-04-16 03:47:27,760 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-16 03:47:27,761 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-16 03:47:27,761 INFO L318 CfgBuilder]: Performing block encoding [2025-04-16 03:47:27,802 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-16 03:47:27,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.04 03:47:27 BoogieIcfgContainer [2025-04-16 03:47:27,802 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-16 03:47:27,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-16 03:47:27,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-16 03:47:27,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-16 03:47:27,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 03:47:26" (1/3) ... [2025-04-16 03:47:27,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2a3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 03:47:27, skipping insertion in model container [2025-04-16 03:47:27,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 03:47:27" (2/3) ... [2025-04-16 03:47:27,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2a3ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 03:47:27, skipping insertion in model container [2025-04-16 03:47:27,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.04 03:47:27" (3/3) ... [2025-04-16 03:47:27,811 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-04-16 03:47:27,820 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-16 03:47:27,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 226 locations, 241 edges, 1 initial locations, 4 loop locations, and 26 error locations. [2025-04-16 03:47:27,822 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-16 03:47:27,892 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-16 03:47:27,929 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:27,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-16 03:47:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 03:47:27,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-16 03:47:27,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-16 03:47:27,993 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:47:28,002 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == checkThreadThread1of1ForFork0 ======== [2025-04-16 03:47:28,008 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:28,008 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-16 03:47:28,212 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr2ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:28,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1601000108, now seen corresponding path program 1 times [2025-04-16 03:47:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:28,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049628484] [2025-04-16 03:47:28,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-16 03:47:28,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-16 03:47:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:28,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:28,401 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-16 03:47:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:28,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049628484] [2025-04-16 03:47:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049628484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:28,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327673167] [2025-04-16 03:47:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:28,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:47:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:28,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:47:28,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:47:28,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,429 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:28,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:47:28,430 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-16 03:47:28,523 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:28,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1529354776, now seen corresponding path program 1 times [2025-04-16 03:47:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:28,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971294067] [2025-04-16 03:47:28,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:28,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-16 03:47:28,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-16 03:47:28,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:28,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:28,639 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-16 03:47:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:28,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971294067] [2025-04-16 03:47:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971294067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:28,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:47:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917381694] [2025-04-16 03:47:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:28,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:28,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:28,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:28,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,642 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:28,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-16 03:47:28,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:28,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:28,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-16 03:47:28,734 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:28,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash -922186814, now seen corresponding path program 1 times [2025-04-16 03:47:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:28,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701256585] [2025-04-16 03:47:28,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:28,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-16 03:47:28,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-16 03:47:28,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:29,045 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-16 03:47:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:29,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701256585] [2025-04-16 03:47:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701256585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:29,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:47:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096129372] [2025-04-16 03:47:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:29,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:47:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:29,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:47:29,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:47:29,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,047 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:29,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-16 03:47:29,047 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,047 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,047 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:29,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-16 03:47:29,263 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:29,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -662326788, now seen corresponding path program 1 times [2025-04-16 03:47:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:29,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768570870] [2025-04-16 03:47:29,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:29,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-16 03:47:29,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-16 03:47:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:29,345 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-16 03:47:29,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:29,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768570870] [2025-04-16 03:47:29,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768570870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:29,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:29,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:29,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197696174] [2025-04-16 03:47:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:29,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:29,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:29,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:29,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,350 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:29,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 55.5) internal successors, (111), 3 states have internal predecessors, (111), 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-16 03:47:29,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:29,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:29,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,789 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 3 remaining) [2025-04-16 03:47:29,789 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2025-04-16 03:47:29,789 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2025-04-16 03:47:29,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-16 03:47:29,796 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-16 03:47:29,797 INFO L320 ceAbstractionStarter]: Result for error location checkThreadThread1of1ForFork0 was SAFE,SAFE,SAFE (1/3) [2025-04-16 03:47:29,801 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:29,802 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:47:29,803 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 03:47:29,803 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:29,803 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-16 03:47:29,867 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:47:29,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -86803256, now seen corresponding path program 1 times [2025-04-16 03:47:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:29,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584624925] [2025-04-16 03:47:29,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:29,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-16 03:47:29,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-16 03:47:29,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:29,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:29,895 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-16 03:47:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:29,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584624925] [2025-04-16 03:47:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584624925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906606823] [2025-04-16 03:47:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:29,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:47:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:29,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:47:29,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:47:29,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,898 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:29,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-16 03:47:29,898 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-16 03:47:29,899 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:47:29,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -263621186, now seen corresponding path program 1 times [2025-04-16 03:47:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:29,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373514125] [2025-04-16 03:47:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:29,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-16 03:47:29,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-16 03:47:29,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:29,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:29,916 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-16 03:47:29,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:29,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373514125] [2025-04-16 03:47:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373514125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499386528] [2025-04-16 03:47:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:29,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:29,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:29,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,917 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:29,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:47:29,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,918 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:29,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-16 03:47:29,960 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:47:29,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 717034134, now seen corresponding path program 1 times [2025-04-16 03:47:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:29,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701904929] [2025-04-16 03:47:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-16 03:47:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-16 03:47:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:29,999 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-16 03:47:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:30,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701904929] [2025-04-16 03:47:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701904929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:30,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:47:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498176175] [2025-04-16 03:47:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:30,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:30,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:30,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:30,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,002 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:30,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-16 03:47:30,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:30,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:30,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:30,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-16 03:47:30,030 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:47:30,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1030948652, now seen corresponding path program 1 times [2025-04-16 03:47:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:30,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542475414] [2025-04-16 03:47:30,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:30,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-16 03:47:30,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-16 03:47:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:47:30,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 03:47:30,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-16 03:47:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-16 03:47:30,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:30,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:47:30,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 03:47:30,120 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 03:47:30,120 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-04-16 03:47:30,121 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-04-16 03:47:30,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-04-16 03:47:30,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-04-16 03:47:30,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-04-16 03:47:30,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 23 remaining) [2025-04-16 03:47:30,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-16 03:47:30,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-16 03:47:30,125 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2025-04-16 03:47:30,126 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 03:47:30,126 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-16 03:47:30,156 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-16 03:47:30,161 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:30,169 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:47:30,170 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == checkThreadThread2of2ForFork0 ======== [2025-04-16 03:47:30,170 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:30,170 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-16 03:47:30,321 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr2ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:30,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -131162670, now seen corresponding path program 1 times [2025-04-16 03:47:30,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:30,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970787742] [2025-04-16 03:47:30,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:30,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-16 03:47:30,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-16 03:47:30,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:30,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:30,367 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-16 03:47:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:30,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970787742] [2025-04-16 03:47:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970787742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527662752] [2025-04-16 03:47:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:30,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:47:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:30,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:47:30,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:47:30,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,370 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:30,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 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-16 03:47:30,370 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-16 03:47:30,487 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:30,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -727375488, now seen corresponding path program 1 times [2025-04-16 03:47:30,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:30,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006515537] [2025-04-16 03:47:30,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:30,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:30,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-04-16 03:47:30,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-04-16 03:47:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:30,550 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-16 03:47:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:30,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006515537] [2025-04-16 03:47:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006515537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:30,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:47:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102800408] [2025-04-16 03:47:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:30,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:30,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:30,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:30,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,552 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:30,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-16 03:47:30,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:30,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-16 03:47:30,620 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:30,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -199540983, now seen corresponding path program 1 times [2025-04-16 03:47:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:30,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766893250] [2025-04-16 03:47:30,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-04-16 03:47:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-04-16 03:47:30,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:30,847 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-16 03:47:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:30,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766893250] [2025-04-16 03:47:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766893250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:30,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:47:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508991303] [2025-04-16 03:47:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:30,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:47:30,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:30,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:47:30,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:47:30,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,849 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:30,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-16 03:47:30,849 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:30,849 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:30,849 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:31,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:31,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-16 03:47:31,077 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:31,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1686040116, now seen corresponding path program 1 times [2025-04-16 03:47:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:31,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061200854] [2025-04-16 03:47:31,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:31,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-16 03:47:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-16 03:47:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:31,239 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-16 03:47:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:31,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061200854] [2025-04-16 03:47:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061200854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:31,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:47:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432759990] [2025-04-16 03:47:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:31,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:47:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:47:31,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:47:31,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,241 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:31,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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-16 03:47:31,241 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,241 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:31,241 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:31,241 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:31,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:31,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:31,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-16 03:47:31,735 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:31,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1599693687, now seen corresponding path program 1 times [2025-04-16 03:47:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:31,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454533971] [2025-04-16 03:47:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-04-16 03:47:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-04-16 03:47:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:31,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:31,797 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-16 03:47:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:31,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454533971] [2025-04-16 03:47:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454533971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:31,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405720867] [2025-04-16 03:47:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:31,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:31,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:31,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:31,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,799 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:31,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 63.0) internal successors, (126), 3 states have internal predecessors, (126), 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-16 03:47:31,799 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:31,799 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:31,799 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:31,799 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:31,799 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:55,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:55,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-16 03:47:55,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:55,461 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 3 remaining) [2025-04-16 03:47:55,461 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2025-04-16 03:47:55,461 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2025-04-16 03:47:55,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-16 03:47:55,463 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-16 03:47:55,464 INFO L320 ceAbstractionStarter]: Result for error location checkThreadThread2of2ForFork0 was SAFE,SAFE,SAFE (1/5) [2025-04-16 03:47:55,466 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:55,466 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:47:55,467 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == setThreadThread1of2ForFork1 ======== [2025-04-16 03:47:55,467 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:55,467 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-16 03:47:55,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:55,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -54687482, now seen corresponding path program 1 times [2025-04-16 03:47:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:55,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169755642] [2025-04-16 03:47:55,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-16 03:47:55,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-16 03:47:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:55,512 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-16 03:47:55,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:55,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169755642] [2025-04-16 03:47:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169755642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918835518] [2025-04-16 03:47:55,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:55,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:47:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:55,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:47:55,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:47:55,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,514 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:55,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-16 03:47:55,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,544 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 2 remaining) [2025-04-16 03:47:55,544 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 2 remaining) [2025-04-16 03:47:55,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-16 03:47:55,546 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 03:47:55,546 INFO L320 ceAbstractionStarter]: Result for error location setThreadThread1of2ForFork1 was SAFE,SAFE (2/5) [2025-04-16 03:47:55,548 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:55,548 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:47:55,548 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == checkThreadThread1of2ForFork0 ======== [2025-04-16 03:47:55,549 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:47:55,549 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-16 03:47:55,609 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr2ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:55,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1024205496, now seen corresponding path program 1 times [2025-04-16 03:47:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:55,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530535551] [2025-04-16 03:47:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-16 03:47:55,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-16 03:47:55,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:55,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:55,628 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-16 03:47:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:55,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530535551] [2025-04-16 03:47:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530535551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806717195] [2025-04-16 03:47:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:55,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:47:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:47:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:47:55,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,630 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:55,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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-16 03:47:55,631 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-16 03:47:55,664 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:55,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash -963307754, now seen corresponding path program 1 times [2025-04-16 03:47:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:55,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697056605] [2025-04-16 03:47:55,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:55,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-16 03:47:55,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-16 03:47:55,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:55,696 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-16 03:47:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:55,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697056605] [2025-04-16 03:47:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697056605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:55,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:55,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:47:55,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061631030] [2025-04-16 03:47:55,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:55,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:55,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:55,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:55,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,698 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:55,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-16 03:47:55,698 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,698 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:55,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-16 03:47:55,729 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:55,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1475704301, now seen corresponding path program 1 times [2025-04-16 03:47:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:55,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767311247] [2025-04-16 03:47:55,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:55,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-16 03:47:55,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-16 03:47:55,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:55,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:55,858 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-16 03:47:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:55,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767311247] [2025-04-16 03:47:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767311247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:47:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359033713] [2025-04-16 03:47:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:55,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:47:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:55,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:47:55,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:47:55,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,861 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:55,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-16 03:47:55,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:55,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:55,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:56,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:56,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:56,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:56,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-16 03:47:56,052 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:47:56,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:47:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -672076953, now seen corresponding path program 1 times [2025-04-16 03:47:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:47:56,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090165000] [2025-04-16 03:47:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:47:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:47:56,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-16 03:47:56,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-16 03:47:56,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:47:56,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:47:56,276 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-16 03:47:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:47:56,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090165000] [2025-04-16 03:47:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090165000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:47:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:47:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:47:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771492068] [2025-04-16 03:47:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:47:56,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:47:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:47:56,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:47:56,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:47:56,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:56,278 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:47:56,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 56.0) internal successors, (112), 3 states have internal predecessors, (112), 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-16 03:47:56,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:47:56,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:47:56,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:47:56,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:48:14,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,136 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 3 remaining) [2025-04-16 03:48:14,136 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2025-04-16 03:48:14,136 INFO L790 garLoopResultBuilder]: Registering result SAFE for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2025-04-16 03:48:14,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-16 03:48:14,138 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-16 03:48:14,138 INFO L320 ceAbstractionStarter]: Result for error location checkThreadThread1of2ForFork0 was SAFE,SAFE,SAFE (3/5) [2025-04-16 03:48:14,141 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,142 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:14,142 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == setThreadThread2of2ForFork1 ======== [2025-04-16 03:48:14,143 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,143 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-16 03:48:14,172 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:14,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash 937633507, now seen corresponding path program 1 times [2025-04-16 03:48:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091204600] [2025-04-16 03:48:14,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-16 03:48:14,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-16 03:48:14,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,187 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-16 03:48:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091204600] [2025-04-16 03:48:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091204600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586426260] [2025-04-16 03:48:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:14,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:14,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,189 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:48:14,190 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,209 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 2 remaining) [2025-04-16 03:48:14,209 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 2 remaining) [2025-04-16 03:48:14,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-16 03:48:14,211 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 03:48:14,211 INFO L320 ceAbstractionStarter]: Result for error location setThreadThread2of2ForFork1 was SAFE,SAFE (4/5) [2025-04-16 03:48:14,213 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,214 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:14,214 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 03:48:14,214 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,214 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-16 03:48:14,245 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -334460099, now seen corresponding path program 1 times [2025-04-16 03:48:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542457554] [2025-04-16 03:48:14,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-16 03:48:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-16 03:48:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,261 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-16 03:48:14,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542457554] [2025-04-16 03:48:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542457554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704196082] [2025-04-16 03:48:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:14,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:14,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,263 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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-16 03:48:14,263 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-16 03:48:14,264 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2085878205, now seen corresponding path program 1 times [2025-04-16 03:48:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913915015] [2025-04-16 03:48:14,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-16 03:48:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-16 03:48:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,273 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-16 03:48:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913915015] [2025-04-16 03:48:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913915015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632278761] [2025-04-16 03:48:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:48:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:48:14,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:48:14,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,275 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:48:14,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-16 03:48:14,329 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash -333064205, now seen corresponding path program 1 times [2025-04-16 03:48:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610441900] [2025-04-16 03:48:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-16 03:48:14,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-16 03:48:14,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,354 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-16 03:48:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610441900] [2025-04-16 03:48:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610441900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:48:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948792707] [2025-04-16 03:48:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:48:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:48:14,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:48:14,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,356 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-16 03:48:14,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,357 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-16 03:48:14,391 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1788061316, now seen corresponding path program 1 times [2025-04-16 03:48:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603992736] [2025-04-16 03:48:14,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-16 03:48:14,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-16 03:48:14,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:48:14,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 03:48:14,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-16 03:48:14,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-16 03:48:14,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:48:14,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 03:48:14,445 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-04-16 03:48:14,445 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-04-16 03:48:14,446 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-04-16 03:48:14,446 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 23 remaining) [2025-04-16 03:48:14,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-16 03:48:14,448 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-16 03:48:14,448 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (5/5) [2025-04-16 03:48:14,448 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 03:48:14,448 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-16 03:48:14,468 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-16 03:48:14,474 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,484 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:14,485 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == setThreadThread2of3ForFork1 ======== [2025-04-16 03:48:14,485 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,485 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-16 03:48:14,525 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:14,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1125331867, now seen corresponding path program 1 times [2025-04-16 03:48:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626406942] [2025-04-16 03:48:14,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-16 03:48:14,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-16 03:48:14,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,540 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-16 03:48:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626406942] [2025-04-16 03:48:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626406942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504803343] [2025-04-16 03:48:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:14,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,542 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:48:14,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,575 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 2 remaining) [2025-04-16 03:48:14,575 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 2 remaining) [2025-04-16 03:48:14,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-16 03:48:14,577 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 03:48:14,577 INFO L320 ceAbstractionStarter]: Result for error location setThreadThread2of3ForFork1 was SAFE,SAFE (1/7) [2025-04-16 03:48:14,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,580 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:14,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == setThreadThread1of3ForFork1 ======== [2025-04-16 03:48:14,580 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,580 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-16 03:48:14,600 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting setThreadErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:14,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1965416638, now seen corresponding path program 1 times [2025-04-16 03:48:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749315095] [2025-04-16 03:48:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-16 03:48:14,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-16 03:48:14,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,610 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-16 03:48:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749315095] [2025-04-16 03:48:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749315095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311576397] [2025-04-16 03:48:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:14,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:14,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,612 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-16 03:48:14,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,656 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 2 remaining) [2025-04-16 03:48:14,656 INFO L790 garLoopResultBuilder]: Registering result SAFE for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 2 remaining) [2025-04-16 03:48:14,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-16 03:48:14,658 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 03:48:14,658 INFO L320 ceAbstractionStarter]: Result for error location setThreadThread1of3ForFork1 was SAFE,SAFE (2/7) [2025-04-16 03:48:14,660 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,660 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:14,660 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 03:48:14,661 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:14,661 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-16 03:48:14,698 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 110773803, now seen corresponding path program 1 times [2025-04-16 03:48:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65821239] [2025-04-16 03:48:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-16 03:48:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-16 03:48:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,717 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-16 03:48:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65821239] [2025-04-16 03:48:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65821239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777794767] [2025-04-16 03:48:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:14,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:14,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:14,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,719 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:48:14,719 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-16 03:48:14,720 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 874513746, now seen corresponding path program 1 times [2025-04-16 03:48:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145374244] [2025-04-16 03:48:14,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-16 03:48:14,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-16 03:48:14,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,729 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-16 03:48:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145374244] [2025-04-16 03:48:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145374244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781302678] [2025-04-16 03:48:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:48:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:48:14,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:48:14,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,732 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 03:48:14,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,732 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-16 03:48:14,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:14,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash -959756695, now seen corresponding path program 1 times [2025-04-16 03:48:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:14,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271356991] [2025-04-16 03:48:14,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:14,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-04-16 03:48:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-04-16 03:48:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:14,926 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-16 03:48:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:14,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271356991] [2025-04-16 03:48:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271356991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:48:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556469609] [2025-04-16 03:48:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:14,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:48:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:14,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:48:14,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:48:14,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,929 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:14,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-16 03:48:14,929 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:14,929 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:14,929 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:15,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:15,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:15,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:15,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-16 03:48:15,033 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-16 03:48:15,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2113657835, now seen corresponding path program 1 times [2025-04-16 03:48:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:15,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375674298] [2025-04-16 03:48:15,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:15,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-16 03:48:15,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-16 03:48:15,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:15,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:48:15,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 03:48:15,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-16 03:48:15,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-16 03:48:15,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:15,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 03:48:15,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 03:48:15,092 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-04-16 03:48:15,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-04-16 03:48:15,093 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 23 remaining) [2025-04-16 03:48:15,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-16 03:48:15,094 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-16 03:48:15,094 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (3/7) [2025-04-16 03:48:15,095 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 03:48:15,095 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-16 03:48:15,113 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-04-16 03:48:15,116 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:15,125 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 03:48:15,126 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == checkThreadThread4of4ForFork0 ======== [2025-04-16 03:48:15,126 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=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;@3bdab469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 03:48:15,126 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-16 03:48:15,546 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr2ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:15,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1724553442, now seen corresponding path program 1 times [2025-04-16 03:48:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:15,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918163291] [2025-04-16 03:48:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-04-16 03:48:15,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-04-16 03:48:15,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:15,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:15,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-16 03:48:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:15,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918163291] [2025-04-16 03:48:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918163291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:15,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:15,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 03:48:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222352561] [2025-04-16 03:48:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:15,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 03:48:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:15,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 03:48:15,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 03:48:15,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:15,582 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:15,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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-16 03:48:15,582 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:17,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:17,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-16 03:48:17,590 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:17,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash 780911820, now seen corresponding path program 1 times [2025-04-16 03:48:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:17,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819522344] [2025-04-16 03:48:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:17,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-04-16 03:48:17,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-04-16 03:48:17,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:17,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:17,643 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-16 03:48:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:17,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819522344] [2025-04-16 03:48:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819522344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-16 03:48:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228693506] [2025-04-16 03:48:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:17,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 03:48:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 03:48:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 03:48:17,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:17,645 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:17,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-16 03:48:17,645 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:17,645 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:18,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:18,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:18,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-16 03:48:18,935 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:18,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 367140497, now seen corresponding path program 1 times [2025-04-16 03:48:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:18,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318929837] [2025-04-16 03:48:18,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-16 03:48:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-16 03:48:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:19,069 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-16 03:48:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:19,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318929837] [2025-04-16 03:48:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318929837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:19,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:19,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:48:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934097054] [2025-04-16 03:48:19,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:19,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:48:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:19,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:48:19,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:48:19,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:19,071 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:19,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-16 03:48:19,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:19,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:19,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:25,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:25,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:25,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:48:25,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-16 03:48:25,778 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting checkThreadErr0ASSERT_VIOLATIONDATA_RACE === [checkThreadErr2ASSERT_VIOLATIONDATA_RACE, checkThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE] === [2025-04-16 03:48:25,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 03:48:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash -286160154, now seen corresponding path program 1 times [2025-04-16 03:48:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 03:48:25,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663656882] [2025-04-16 03:48:25,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 03:48:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 03:48:25,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-04-16 03:48:25,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-04-16 03:48:25,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 03:48:25,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 03:48:25,931 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-16 03:48:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 03:48:25,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663656882] [2025-04-16 03:48:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663656882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 03:48:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 03:48:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 03:48:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886888301] [2025-04-16 03:48:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 03:48:25,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 03:48:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 03:48:25,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 03:48:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-16 03:48:25,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:25,933 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 03:48:25,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-16 03:48:25,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 03:48:25,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 03:48:25,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-16 03:48:25,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.