./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dadbc714432dbabd9f10b5aceb2a2ff8af11608da70d21414f772d02695c7806 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:03,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:03,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:11:03,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:03,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:03,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:03,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:03,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:03,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:03,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:03,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:03,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:03,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:03,614 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:03,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:03,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:03,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dadbc714432dbabd9f10b5aceb2a2ff8af11608da70d21414f772d02695c7806 [2025-02-08 05:11:03,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:03,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:03,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:03,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:03,854 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:03,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i [2025-02-08 05:11:05,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f32789625/f1dad91175ec4cc3af0ebc0a7464fe67/FLAGbfcc23499 [2025-02-08 05:11:05,471 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:05,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i [2025-02-08 05:11:05,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f32789625/f1dad91175ec4cc3af0ebc0a7464fe67/FLAGbfcc23499 [2025-02-08 05:11:05,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f32789625/f1dad91175ec4cc3af0ebc0a7464fe67 [2025-02-08 05:11:05,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:05,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:05,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:05,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:05,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:05,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:05,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f6cea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05, skipping insertion in model container [2025-02-08 05:11:05,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:05,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:05,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:05,828 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:05,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:05,923 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:05,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05 WrapperNode [2025-02-08 05:11:05,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:05,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:05,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:05,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:05,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:05,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:05,996 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 928 [2025-02-08 05:11:05,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:05,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:05,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:05,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:06,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:06,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:06,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:06,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:06,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (1/1) ... [2025-02-08 05:11:06,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:06,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:11:06,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:11:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:06,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:06,078 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:11:06,179 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:06,180 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:06,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-8: __VERIFIER_atomic_assert_#t~short14#1 := 0 == __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret13#1 && __VERIFIER_atomic_assert_#t~ret13#1 <= 2147483647; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-10: __VERIFIER_atomic_assert_#t~ret13#1 := isEmpty_#res#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-11: assume !__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-12: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-13: __VERIFIER_atomic_assert_#t~short14#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696: assume { :end_inline_assume_abort_if_not } true;havoc __VERIFIER_atomic_release_#t~mem5#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-1: push_#res#1 := 0; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-4: assume ((0 == #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] && 0 == #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset]; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-4: assume !(((0 == #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] && 0 == #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset]); [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-5: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 1 == __VERIFIER_atomic_release_#t~mem5#1 then 1 else 0); [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-6: #race := #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-7: #race := #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-8: #race := #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-9: #race := #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset := 0]; [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-10: SUMMARY for call __VERIFIER_atomic_release_#t~mem5#1 := read~int(__VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:06,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: assume ((#race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1 && #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: assume !(((#race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1 && #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1) && #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset] == __VERIFIER_atomic_release_#t~nondet6#1); [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-1: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-2: #race := #race[__VERIFIER_atomic_release_~m#1.base,3 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-3: #race := #race[__VERIFIER_atomic_release_~m#1.base,2 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-4: #race := #race[__VERIFIER_atomic_release_~m#1.base,1 + __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-5: #race := #race[__VERIFIER_atomic_release_~m#1.base,__VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#t~nondet6#1]; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-6: havoc __VERIFIER_atomic_release_#t~nondet6#1; [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L697-7: SUMMARY for call write~int(0, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:06,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-1: assume false; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4-3: assume false; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet10#1; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet10#1); [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc push_#t~nondet10#1; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet10#1]; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-3: havoc push_#t~nondet10#1; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: [2025-02-08 05:11:06,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: havoc __VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset;assume { :end_inline___VERIFIER_atomic_acquire } true; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: havoc __VERIFIER_atomic_acquire_#t~mem3#1, __VERIFIER_atomic_acquire_#t~nondet4#1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-3: havoc __VERIFIER_atomic_acquire_#t~mem3#1, __VERIFIER_atomic_acquire_#t~nondet4#1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-4: assume { :begin_inline___VERIFIER_atomic_acquire } true;__VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset := ~#m~0.base, ~#m~0.offset; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume 0 == #race~top~0; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: assume !(0 == #race~top~0); [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: push_~oldTop~0#1 := ~top~0; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: #race~top~0 := 0; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet11#1; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet11#1); [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc push_#t~nondet11#1; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet11#1]; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-3: havoc push_#t~nondet11#1; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:06,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_loop_#t~ret16#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: push_loop_~r~0#1 := push_loop_#t~ret16#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret16#1 && push_loop_#t~ret16#1 <= 2147483647; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: havoc push_#in~d#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: havoc push_#t~ret9#1, push_#t~nondet10#1, push_#t~nondet11#1, push_#t~nondet12#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: push_loop_#t~ret16#1 := push_#res#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume #race~top~0 == push_#t~nondet12#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume !(#race~top~0 == push_#t~nondet12#1); [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc push_#t~nondet12#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: #race~top~0 := push_#t~nondet12#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: havoc push_#t~nondet12#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: ~top~0 := push_~newTop~0#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-2: havoc __VERIFIER_atomic_assert_#t~ret13#1, __VERIFIER_atomic_assert_#t~short14#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-3: havoc __VERIFIER_atomic_assert_#t~ret13#1, __VERIFIER_atomic_assert_#t~short14#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc __VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset;assume { :end_inline___VERIFIER_atomic_release } true; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: havoc __VERIFIER_atomic_release_#t~mem5#1, __VERIFIER_atomic_release_#t~nondet6#1, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: havoc __VERIFIER_atomic_release_#t~mem5#1, __VERIFIER_atomic_release_#t~nondet6#1, __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-4: assume { :begin_inline___VERIFIER_atomic_release } true;__VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset := ~#m~0.base, ~#m~0.offset; [2025-02-08 05:11:06,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume 0 == ~top~0; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(0 == ~top~0); [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume 0 == #race~top~0; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: assume !(0 == #race~top~0); [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: #race~top~0 := 0; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: push_#res#1 := 1; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L689: __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#in~m#1.base, __VERIFIER_atomic_acquire_#in~m#1.offset; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume { :end_inline_assume_abort_if_not } true;havoc __VERIFIER_atomic_acquire_#t~mem3#1; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:11:06,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-4: assume ((0 == #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-4: assume !(((0 == #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset]) && 0 == #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset]); [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-5: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if 0 == __VERIFIER_atomic_acquire_#t~mem3#1 then 1 else 0); [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-6: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-7: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-8: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-9: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset := 0]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-10: SUMMARY for call __VERIFIER_atomic_acquire_#t~mem3#1 := read~int(__VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume ((#race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1 && #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692: assume !(((#race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1 && #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1) && #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset] == __VERIFIER_atomic_acquire_#t~nondet4#1); [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-1: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-2: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,3 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-3: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,2 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-4: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,1 + __VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-5: #race := #race[__VERIFIER_atomic_acquire_~m#1.base,__VERIFIER_atomic_acquire_~m#1.offset := __VERIFIER_atomic_acquire_#t~nondet4#1]; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-6: havoc __VERIFIER_atomic_acquire_#t~nondet4#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L692-7: SUMMARY for call write~int(1, __VERIFIER_atomic_acquire_~m#1.base, __VERIFIER_atomic_acquire_~m#1.offset, 4); srcloc: null [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc push_#t~ret9#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: __VERIFIER_atomic_release_~m#1.base, __VERIFIER_atomic_release_~m#1.offset := __VERIFIER_atomic_release_#in~m#1.base, __VERIFIER_atomic_release_#in~m#1.offset; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: push_~newTop~0#1 := push_#t~ret9#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret9#1 && push_#t~ret9#1 <= 2147483647; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-3: havoc index_malloc_#t~nondet7#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:06,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-4: push_#t~ret9#1 := index_malloc_#res#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-3: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-4: havoc __VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: assume !!__VERIFIER_atomic_assert_#t~short14#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-6: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:06,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-7: havoc __VERIFIER_atomic_assert_#t~ret13#1; [2025-02-08 05:11:06,871 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:06,871 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:06,995 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:06,996 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:06,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:06 BoogieIcfgContainer [2025-02-08 05:11:06,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:06,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:06,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:07,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:07,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:05" (1/3) ... [2025-02-08 05:11:07,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3b570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:07, skipping insertion in model container [2025-02-08 05:11:07,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:05" (2/3) ... [2025-02-08 05:11:07,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3b570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:07, skipping insertion in model container [2025-02-08 05:11:07,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:06" (3/3) ... [2025-02-08 05:11:07,002 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-2-race.i [2025-02-08 05:11:07,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:07,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack_longer-2-race.i that has 2 procedures, 749 locations, 1 initial locations, 2 loop locations, and 26 error locations. [2025-02-08 05:11:07,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:07,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:07,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:07,424 INFO L124 PetriNetUnfolderBase]: 2/758 cut-off events. [2025-02-08 05:11:07,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:07,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 758 events. 2/758 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-08 05:11:07,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:07,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 752 places, 751 transitions, 1506 flow [2025-02-08 05:11:07,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:07,482 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6abfd0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:07,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:07,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:07,609 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:07,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:07,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:07,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1475655310, now seen corresponding path program 1 times [2025-02-08 05:11:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557406462] [2025-02-08 05:11:07,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:08,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:08,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:08,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557406462] [2025-02-08 05:11:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557406462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296878688] [2025-02-08 05:11:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:10,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:10,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:10,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 751 [2025-02-08 05:11:10,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 751 transitions, 1506 flow. Second operand has 2 states, 2 states have (on average 734.0) internal successors, (1468), 2 states have internal predecessors, (1468), 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-02-08 05:11:10,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:10,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 751 [2025-02-08 05:11:10,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:10,416 INFO L124 PetriNetUnfolderBase]: 2/738 cut-off events. [2025-02-08 05:11:10,416 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:10,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 738 events. 2/738 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 6/734 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2025-02-08 05:11:10,419 INFO L140 encePairwiseOnDemand]: 739/751 looper letters, 6 selfloop transitions, 0 changer transitions 0/735 dead transitions. [2025-02-08 05:11:10,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 735 transitions, 1486 flow [2025-02-08 05:11:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1484 transitions. [2025-02-08 05:11:10,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9880159786950732 [2025-02-08 05:11:10,444 INFO L175 Difference]: Start difference. First operand has 752 places, 751 transitions, 1506 flow. Second operand 2 states and 1484 transitions. [2025-02-08 05:11:10,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 735 transitions, 1486 flow [2025-02-08 05:11:10,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 735 transitions, 1486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:10,482 INFO L231 Difference]: Finished difference. Result has 737 places, 735 transitions, 1474 flow [2025-02-08 05:11:10,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=751, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1474, PETRI_PLACES=737, PETRI_TRANSITIONS=735} [2025-02-08 05:11:10,491 INFO L279 CegarLoopForPetriNet]: 752 programPoint places, -15 predicate places. [2025-02-08 05:11:10,492 INFO L471 AbstractCegarLoop]: Abstraction has has 737 places, 735 transitions, 1474 flow [2025-02-08 05:11:10,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 734.0) internal successors, (1468), 2 states have internal predecessors, (1468), 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-02-08 05:11:10,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:10,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:10,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash 765609106, now seen corresponding path program 1 times [2025-02-08 05:11:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462012877] [2025-02-08 05:11:10,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:10,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:10,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462012877] [2025-02-08 05:11:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462012877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091280331] [2025-02-08 05:11:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:11,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:11,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:11,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 751 [2025-02-08 05:11:11,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 735 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 730.3333333333334) internal successors, (2191), 3 states have internal predecessors, (2191), 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-02-08 05:11:11,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:11,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 751 [2025-02-08 05:11:11,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:11,269 INFO L124 PetriNetUnfolderBase]: 2/785 cut-off events. [2025-02-08 05:11:11,269 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:11,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 785 events. 2/785 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 200 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 800. Up to 8 conditions per place. [2025-02-08 05:11:11,271 INFO L140 encePairwiseOnDemand]: 748/751 looper letters, 11 selfloop transitions, 2 changer transitions 0/738 dead transitions. [2025-02-08 05:11:11,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 738 transitions, 1506 flow [2025-02-08 05:11:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2201 transitions. [2025-02-08 05:11:11,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9769196626719929 [2025-02-08 05:11:11,278 INFO L175 Difference]: Start difference. First operand has 737 places, 735 transitions, 1474 flow. Second operand 3 states and 2201 transitions. [2025-02-08 05:11:11,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 738 transitions, 1506 flow [2025-02-08 05:11:11,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 738 transitions, 1506 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:11,291 INFO L231 Difference]: Finished difference. Result has 738 places, 734 transitions, 1476 flow [2025-02-08 05:11:11,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=751, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=738, PETRI_TRANSITIONS=734} [2025-02-08 05:11:11,294 INFO L279 CegarLoopForPetriNet]: 752 programPoint places, -14 predicate places. [2025-02-08 05:11:11,294 INFO L471 AbstractCegarLoop]: Abstraction has has 738 places, 734 transitions, 1476 flow [2025-02-08 05:11:11,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.3333333333334) internal successors, (2191), 3 states have internal predecessors, (2191), 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-02-08 05:11:11,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:11,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:11,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:11,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:11,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1385581565, now seen corresponding path program 1 times [2025-02-08 05:11:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:11,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17142590] [2025-02-08 05:11:11,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:11,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:11,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:11,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:11,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:11,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:11,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:11,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:11,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:11,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:11,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:11,786 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:11,787 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:11,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:11,793 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:11,793 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:11,851 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:11,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:11,959 INFO L124 PetriNetUnfolderBase]: 4/849 cut-off events. [2025-02-08 05:11:11,960 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 849 events. 4/849 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs, 0 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 759. Up to 3 conditions per place. [2025-02-08 05:11:11,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:11,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 834 places, 833 transitions, 1676 flow [2025-02-08 05:11:11,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:11,967 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6abfd0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:11,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:12,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:12,016 INFO L124 PetriNetUnfolderBase]: 0/669 cut-off events. [2025-02-08 05:11:12,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:12,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:12,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:12,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2049845888, now seen corresponding path program 1 times [2025-02-08 05:11:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162880377] [2025-02-08 05:11:12,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:12,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:12,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:12,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162880377] [2025-02-08 05:11:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162880377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008551398] [2025-02-08 05:11:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:13,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:13,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:13,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 798 out of 833 [2025-02-08 05:11:13,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 833 transitions, 1676 flow. Second operand has 2 states, 2 states have (on average 799.0) internal successors, (1598), 2 states have internal predecessors, (1598), 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-02-08 05:11:13,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:13,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 798 of 833 [2025-02-08 05:11:13,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:13,854 INFO L124 PetriNetUnfolderBase]: 38/1217 cut-off events. [2025-02-08 05:11:13,854 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:13,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1217 events. 38/1217 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2913 event pairs, 23 based on Foata normal form. 44/1179 useless extension candidates. Maximal degree in co-relation 745. Up to 66 conditions per place. [2025-02-08 05:11:13,862 INFO L140 encePairwiseOnDemand]: 810/833 looper letters, 12 selfloop transitions, 0 changer transitions 0/805 dead transitions. [2025-02-08 05:11:13,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 805 transitions, 1644 flow [2025-02-08 05:11:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1631 transitions. [2025-02-08 05:11:13,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9789915966386554 [2025-02-08 05:11:13,868 INFO L175 Difference]: Start difference. First operand has 834 places, 833 transitions, 1676 flow. Second operand 2 states and 1631 transitions. [2025-02-08 05:11:13,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 805 transitions, 1644 flow [2025-02-08 05:11:13,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 805 transitions, 1644 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:13,882 INFO L231 Difference]: Finished difference. Result has 807 places, 805 transitions, 1620 flow [2025-02-08 05:11:13,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1620, PETRI_PLACES=807, PETRI_TRANSITIONS=805} [2025-02-08 05:11:13,883 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -27 predicate places. [2025-02-08 05:11:13,883 INFO L471 AbstractCegarLoop]: Abstraction has has 807 places, 805 transitions, 1620 flow [2025-02-08 05:11:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 799.0) internal successors, (1598), 2 states have internal predecessors, (1598), 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-02-08 05:11:13,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:13,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:13,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1487997372, now seen corresponding path program 1 times [2025-02-08 05:11:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742929650] [2025-02-08 05:11:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:14,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:14,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:14,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742929650] [2025-02-08 05:11:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742929650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954715710] [2025-02-08 05:11:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:14,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 833 [2025-02-08 05:11:14,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 805 transitions, 1620 flow. Second operand has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 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-02-08 05:11:14,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:14,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 833 [2025-02-08 05:11:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:14,552 INFO L124 PetriNetUnfolderBase]: 151/2351 cut-off events. [2025-02-08 05:11:14,552 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:11:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 2351 events. 151/2351 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13592 event pairs, 48 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2675. Up to 146 conditions per place. [2025-02-08 05:11:14,564 INFO L140 encePairwiseOnDemand]: 825/833 looper letters, 31 selfloop transitions, 6 changer transitions 0/822 dead transitions. [2025-02-08 05:11:14,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 822 transitions, 1733 flow [2025-02-08 05:11:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2409 transitions. [2025-02-08 05:11:14,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963985594237695 [2025-02-08 05:11:14,568 INFO L175 Difference]: Start difference. First operand has 807 places, 805 transitions, 1620 flow. Second operand 3 states and 2409 transitions. [2025-02-08 05:11:14,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 822 transitions, 1733 flow [2025-02-08 05:11:14,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 822 transitions, 1733 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:14,578 INFO L231 Difference]: Finished difference. Result has 811 places, 811 transitions, 1672 flow [2025-02-08 05:11:14,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1672, PETRI_PLACES=811, PETRI_TRANSITIONS=811} [2025-02-08 05:11:14,579 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -23 predicate places. [2025-02-08 05:11:14,579 INFO L471 AbstractCegarLoop]: Abstraction has has 811 places, 811 transitions, 1672 flow [2025-02-08 05:11:14,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 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-02-08 05:11:14,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:14,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:14,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -395502005, now seen corresponding path program 1 times [2025-02-08 05:11:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:14,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228519609] [2025-02-08 05:11:14,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:14,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-08 05:11:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-08 05:11:14,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:14,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228519609] [2025-02-08 05:11:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228519609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151780919] [2025-02-08 05:11:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:14,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:14,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:14,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 833 [2025-02-08 05:11:14,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 811 transitions, 1672 flow. Second operand has 3 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 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-02-08 05:11:14,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:14,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 833 [2025-02-08 05:11:14,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:15,296 INFO L124 PetriNetUnfolderBase]: 196/2405 cut-off events. [2025-02-08 05:11:15,296 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-08 05:11:15,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 2405 events. 196/2405 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 14561 event pairs, 98 based on Foata normal form. 0/2156 useless extension candidates. Maximal degree in co-relation 2896. Up to 314 conditions per place. [2025-02-08 05:11:15,311 INFO L140 encePairwiseOnDemand]: 828/833 looper letters, 25 selfloop transitions, 4 changer transitions 0/820 dead transitions. [2025-02-08 05:11:15,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 820 transitions, 1753 flow [2025-02-08 05:11:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2400 transitions. [2025-02-08 05:11:15,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603841536614646 [2025-02-08 05:11:15,316 INFO L175 Difference]: Start difference. First operand has 811 places, 811 transitions, 1672 flow. Second operand 3 states and 2400 transitions. [2025-02-08 05:11:15,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 820 transitions, 1753 flow [2025-02-08 05:11:15,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 811 places, 820 transitions, 1741 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:15,326 INFO L231 Difference]: Finished difference. Result has 813 places, 814 transitions, 1690 flow [2025-02-08 05:11:15,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1690, PETRI_PLACES=813, PETRI_TRANSITIONS=814} [2025-02-08 05:11:15,328 INFO L279 CegarLoopForPetriNet]: 834 programPoint places, -21 predicate places. [2025-02-08 05:11:15,328 INFO L471 AbstractCegarLoop]: Abstraction has has 813 places, 814 transitions, 1690 flow [2025-02-08 05:11:15,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 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-02-08 05:11:15,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:15,329 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:15,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:15,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1446062595, now seen corresponding path program 1 times [2025-02-08 05:11:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340106585] [2025-02-08 05:11:15,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:15,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-02-08 05:11:15,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-02-08 05:11:15,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:15,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:15,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-02-08 05:11:15,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-02-08 05:11:15,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:15,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:15,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:15,609 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:15,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:15,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:15,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:15,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:15,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:15,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:15,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:15,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:15,615 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:11:15,615 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:15,615 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:15,692 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:15,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:15,806 INFO L124 PetriNetUnfolderBase]: 6/940 cut-off events. [2025-02-08 05:11:15,806 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 940 events. 6/940 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1102 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 853. Up to 4 conditions per place. [2025-02-08 05:11:15,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:15,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 916 places, 915 transitions, 1848 flow [2025-02-08 05:11:15,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:15,816 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6abfd0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:15,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:15,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:15,857 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:15,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:15,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:15,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:15,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 226281892, now seen corresponding path program 1 times [2025-02-08 05:11:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600653640] [2025-02-08 05:11:15,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:15,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:15,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600653640] [2025-02-08 05:11:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600653640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928600319] [2025-02-08 05:11:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:16,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:16,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:16,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 863 out of 915 [2025-02-08 05:11:16,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 916 places, 915 transitions, 1848 flow. Second operand has 2 states, 2 states have (on average 864.0) internal successors, (1728), 2 states have internal predecessors, (1728), 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-02-08 05:11:16,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:16,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 863 of 915 [2025-02-08 05:11:16,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:17,555 INFO L124 PetriNetUnfolderBase]: 392/4130 cut-off events. [2025-02-08 05:11:17,555 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:17,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 4130 events. 392/4130 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 32327 event pairs, 294 based on Foata normal form. 303/3921 useless extension candidates. Maximal degree in co-relation 3352. Up to 561 conditions per place. [2025-02-08 05:11:17,589 INFO L140 encePairwiseOnDemand]: 881/915 looper letters, 18 selfloop transitions, 0 changer transitions 0/875 dead transitions. [2025-02-08 05:11:17,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 875 transitions, 1804 flow [2025-02-08 05:11:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1778 transitions. [2025-02-08 05:11:17,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9715846994535519 [2025-02-08 05:11:17,593 INFO L175 Difference]: Start difference. First operand has 916 places, 915 transitions, 1848 flow. Second operand 2 states and 1778 transitions. [2025-02-08 05:11:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 875 transitions, 1804 flow [2025-02-08 05:11:17,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 877 places, 875 transitions, 1802 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:17,602 INFO L231 Difference]: Finished difference. Result has 877 places, 875 transitions, 1766 flow [2025-02-08 05:11:17,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1766, PETRI_PLACES=877, PETRI_TRANSITIONS=875} [2025-02-08 05:11:17,604 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -39 predicate places. [2025-02-08 05:11:17,605 INFO L471 AbstractCegarLoop]: Abstraction has has 877 places, 875 transitions, 1766 flow [2025-02-08 05:11:17,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 864.0) internal successors, (1728), 2 states have internal predecessors, (1728), 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-02-08 05:11:17,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:17,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:17,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1586311480, now seen corresponding path program 1 times [2025-02-08 05:11:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145745040] [2025-02-08 05:11:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:17,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:17,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:17,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:17,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:17,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:17,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145745040] [2025-02-08 05:11:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145745040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:17,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:17,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408802970] [2025-02-08 05:11:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:17,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:17,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:17,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 851 out of 915 [2025-02-08 05:11:17,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 875 transitions, 1766 flow. Second operand has 3 states, 3 states have (on average 852.3333333333334) internal successors, (2557), 3 states have internal predecessors, (2557), 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-02-08 05:11:17,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:17,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 851 of 915 [2025-02-08 05:11:17,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:20,856 INFO L124 PetriNetUnfolderBase]: 3243/19987 cut-off events. [2025-02-08 05:11:20,857 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-02-08 05:11:20,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25279 conditions, 19987 events. 3243/19987 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 253139 event pairs, 1141 based on Foata normal form. 0/17147 useless extension candidates. Maximal degree in co-relation 25273. Up to 2476 conditions per place. [2025-02-08 05:11:21,000 INFO L140 encePairwiseOnDemand]: 903/915 looper letters, 47 selfloop transitions, 9 changer transitions 0/901 dead transitions. [2025-02-08 05:11:21,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 901 transitions, 1940 flow [2025-02-08 05:11:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2612 transitions. [2025-02-08 05:11:21,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515482695810564 [2025-02-08 05:11:21,005 INFO L175 Difference]: Start difference. First operand has 877 places, 875 transitions, 1766 flow. Second operand 3 states and 2612 transitions. [2025-02-08 05:11:21,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 901 transitions, 1940 flow [2025-02-08 05:11:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 901 transitions, 1940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:21,018 INFO L231 Difference]: Finished difference. Result has 881 places, 884 transitions, 1844 flow [2025-02-08 05:11:21,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1844, PETRI_PLACES=881, PETRI_TRANSITIONS=884} [2025-02-08 05:11:21,021 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -35 predicate places. [2025-02-08 05:11:21,021 INFO L471 AbstractCegarLoop]: Abstraction has has 881 places, 884 transitions, 1844 flow [2025-02-08 05:11:21,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 852.3333333333334) internal successors, (2557), 3 states have internal predecessors, (2557), 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-02-08 05:11:21,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:21,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:11:21,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1087028806, now seen corresponding path program 1 times [2025-02-08 05:11:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104632965] [2025-02-08 05:11:21,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:21,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-02-08 05:11:21,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-02-08 05:11:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104632965] [2025-02-08 05:11:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104632965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228059510] [2025-02-08 05:11:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:21,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 854 out of 915 [2025-02-08 05:11:21,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 884 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 856.0) internal successors, (2568), 3 states have internal predecessors, (2568), 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-02-08 05:11:21,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:21,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 854 of 915 [2025-02-08 05:11:21,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:23,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0), 217#L767-1true, 921#true]) [2025-02-08 05:11:23,788 INFO L294 olderBase$Statistics]: this new event has 727 ancestors and is cut-off event [2025-02-08 05:11:23,788 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:11:23,788 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:11:23,788 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:11:23,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0), 228#L763true, 217#L767-1true, 921#true]) [2025-02-08 05:11:23,859 INFO L294 olderBase$Statistics]: this new event has 728 ancestors and is cut-off event [2025-02-08 05:11:23,859 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:11:23,859 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:11:23,859 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:11:25,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 11#L706-2true, Black: 923#(= |#race~state~0| 0), 921#true]) [2025-02-08 05:11:25,016 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:11:25,016 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:11:25,016 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:11:25,016 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:11:25,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 11#L706-2true, Black: 923#(= |#race~state~0| 0), 228#L763true, 921#true]) [2025-02-08 05:11:25,080 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-08 05:11:25,080 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:11:25,080 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:11:25,080 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:11:25,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 323#L763-1true, 919#true, 475#L775-2true, 926#true, 915#true, 482#L767-1true, 567#L708true, Black: 923#(= |#race~state~0| 0), 921#true]) [2025-02-08 05:11:25,236 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:11:25,236 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:25,236 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-02-08 05:11:25,236 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:11:25,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3698] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][760], [913#true, 917#true, 919#true, 475#L775-2true, 915#true, 926#true, 482#L767-1true, 567#L708true, Black: 923#(= |#race~state~0| 0), 228#L763true, 921#true]) [2025-02-08 05:11:25,286 INFO L294 olderBase$Statistics]: this new event has 748 ancestors and is cut-off event [2025-02-08 05:11:25,287 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2025-02-08 05:11:25,287 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:11:25,287 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:11:26,023 INFO L124 PetriNetUnfolderBase]: 4471/27498 cut-off events. [2025-02-08 05:11:26,023 INFO L125 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-02-08 05:11:26,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35815 conditions, 27498 events. 4471/27498 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 381016 event pairs, 2321 based on Foata normal form. 0/23597 useless extension candidates. Maximal degree in co-relation 35807. Up to 5493 conditions per place. [2025-02-08 05:11:26,278 INFO L140 encePairwiseOnDemand]: 909/915 looper letters, 38 selfloop transitions, 5 changer transitions 0/900 dead transitions. [2025-02-08 05:11:26,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 900 transitions, 1972 flow [2025-02-08 05:11:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2606 transitions. [2025-02-08 05:11:26,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493624772313297 [2025-02-08 05:11:26,283 INFO L175 Difference]: Start difference. First operand has 881 places, 884 transitions, 1844 flow. Second operand 3 states and 2606 transitions. [2025-02-08 05:11:26,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 900 transitions, 1972 flow [2025-02-08 05:11:26,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 900 transitions, 1954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:26,299 INFO L231 Difference]: Finished difference. Result has 883 places, 888 transitions, 1864 flow [2025-02-08 05:11:26,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=879, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1864, PETRI_PLACES=883, PETRI_TRANSITIONS=888} [2025-02-08 05:11:26,301 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -33 predicate places. [2025-02-08 05:11:26,301 INFO L471 AbstractCegarLoop]: Abstraction has has 883 places, 888 transitions, 1864 flow [2025-02-08 05:11:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 856.0) internal successors, (2568), 3 states have internal predecessors, (2568), 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-02-08 05:11:26,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:26,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:26,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:11:26,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:26,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1259368553, now seen corresponding path program 1 times [2025-02-08 05:11:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210414625] [2025-02-08 05:11:26,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-08 05:11:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-08 05:11:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:26,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-02-08 05:11:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210414625] [2025-02-08 05:11:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210414625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:26,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270801609] [2025-02-08 05:11:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:26,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:26,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:26,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:26,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 854 out of 915 [2025-02-08 05:11:26,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 888 transitions, 1864 flow. Second operand has 3 states, 3 states have (on average 856.3333333333334) internal successors, (2569), 3 states have internal predecessors, (2569), 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-02-08 05:11:26,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:26,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 854 of 915 [2025-02-08 05:11:26,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:28,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 482#L767-1true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:28,780 INFO L294 olderBase$Statistics]: this new event has 726 ancestors and is cut-off event [2025-02-08 05:11:28,780 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:28,780 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:28,780 INFO L297 olderBase$Statistics]: existing Event has 715 ancestors and is cut-off event [2025-02-08 05:11:30,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 750#L706-2true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:30,276 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:11:30,276 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:30,276 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:30,276 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:11:30,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 917#true, 370#L717-1true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, 100#L708true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:30,554 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-08 05:11:30,554 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:30,554 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:30,554 INFO L297 olderBase$Statistics]: existing Event has 735 ancestors and is cut-off event [2025-02-08 05:11:31,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3779] L766-4-->L767-1: Formula: (let ((.cse0 (select |v_#race_583| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 3))) (let ((.cse2 (select |v_#memory_int_183| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 1)) (.cse4 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (select .cse0 .cse5))) (and (= (select .cse0 |v_~#m2~0.offset_21|) .cse1) (not (= (ite (= (select .cse2 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= |v_#memory_int_182| (store |v_#memory_int_183| |v_~#m2~0.base_21| (store .cse2 |v_~#m2~0.offset_21| 0))) (= (select .cse0 .cse3) .cse1) (= |v_#race_583| (store |v_#race_585| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_585| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1))) (= (select .cse0 .cse4) .cse1)))) InVars {#race=|v_#race_585|, #memory_int=|v_#memory_int_183|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_583|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_182|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread1of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread1of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1][758], [913#true, Black: 928#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 837#L714-1true, 917#true, 933#(= |thr1Thread2of3ForFork0_EBStack_init_#t~nondet8#1| |#race~top~0|), 370#L717-1true, 919#true, 475#L775-2true, 398#L767-1true, 926#true, 915#true, Black: 923#(= |#race~state~0| 0)]) [2025-02-08 05:11:31,172 INFO L294 olderBase$Statistics]: this new event has 756 ancestors and is cut-off event [2025-02-08 05:11:31,172 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:31,172 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:31,172 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:11:31,485 INFO L124 PetriNetUnfolderBase]: 5145/29446 cut-off events. [2025-02-08 05:11:31,486 INFO L125 PetriNetUnfolderBase]: For 1803/1907 co-relation queries the response was YES. [2025-02-08 05:11:31,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40099 conditions, 29446 events. 5145/29446 cut-off events. For 1803/1907 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 413957 event pairs, 2700 based on Foata normal form. 0/25247 useless extension candidates. Maximal degree in co-relation 40090. Up to 6438 conditions per place. [2025-02-08 05:11:31,730 INFO L140 encePairwiseOnDemand]: 909/915 looper letters, 38 selfloop transitions, 7 changer transitions 0/904 dead transitions. [2025-02-08 05:11:31,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 904 transitions, 2001 flow [2025-02-08 05:11:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2605 transitions. [2025-02-08 05:11:31,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9489981785063752 [2025-02-08 05:11:31,747 INFO L175 Difference]: Start difference. First operand has 883 places, 888 transitions, 1864 flow. Second operand 3 states and 2605 transitions. [2025-02-08 05:11:31,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 904 transitions, 2001 flow [2025-02-08 05:11:31,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 904 transitions, 1987 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:31,783 INFO L231 Difference]: Finished difference. Result has 885 places, 893 transitions, 1910 flow [2025-02-08 05:11:31,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1910, PETRI_PLACES=885, PETRI_TRANSITIONS=893} [2025-02-08 05:11:31,788 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -31 predicate places. [2025-02-08 05:11:31,788 INFO L471 AbstractCegarLoop]: Abstraction has has 885 places, 893 transitions, 1910 flow [2025-02-08 05:11:31,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 856.3333333333334) internal successors, (2569), 3 states have internal predecessors, (2569), 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-02-08 05:11:31,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:31,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:11:31,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err21ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1971657885, now seen corresponding path program 1 times [2025-02-08 05:11:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282670465] [2025-02-08 05:11:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:31,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-08 05:11:31,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-08 05:11:31,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:31,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282670465] [2025-02-08 05:11:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282670465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:32,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:32,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155307152] [2025-02-08 05:11:32,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:32,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:32,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:32,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:32,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 852 out of 915 [2025-02-08 05:11:32,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 893 transitions, 1910 flow. Second operand has 3 states, 3 states have (on average 854.0) internal successors, (2562), 3 states have internal predecessors, (2562), 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-02-08 05:11:32,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:32,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 852 of 915 [2025-02-08 05:11:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:39,128 INFO L124 PetriNetUnfolderBase]: 7106/46358 cut-off events. [2025-02-08 05:11:39,128 INFO L125 PetriNetUnfolderBase]: For 3242/4080 co-relation queries the response was YES. [2025-02-08 05:11:39,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61629 conditions, 46358 events. 7106/46358 cut-off events. For 3242/4080 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 702955 event pairs, 2788 based on Foata normal form. 50/40032 useless extension candidates. Maximal degree in co-relation 61619. Up to 7604 conditions per place. [2025-02-08 05:11:39,517 INFO L140 encePairwiseOnDemand]: 907/915 looper letters, 49 selfloop transitions, 12 changer transitions 0/919 dead transitions. [2025-02-08 05:11:39,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 919 transitions, 2110 flow [2025-02-08 05:11:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2025-02-08 05:11:39,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9500910746812387 [2025-02-08 05:11:39,521 INFO L175 Difference]: Start difference. First operand has 885 places, 893 transitions, 1910 flow. Second operand 3 states and 2608 transitions. [2025-02-08 05:11:39,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 919 transitions, 2110 flow [2025-02-08 05:11:39,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 885 places, 919 transitions, 2096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:39,534 INFO L231 Difference]: Finished difference. Result has 887 places, 903 transitions, 2002 flow [2025-02-08 05:11:39,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=915, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2002, PETRI_PLACES=887, PETRI_TRANSITIONS=903} [2025-02-08 05:11:39,536 INFO L279 CegarLoopForPetriNet]: 916 programPoint places, -29 predicate places. [2025-02-08 05:11:39,536 INFO L471 AbstractCegarLoop]: Abstraction has has 887 places, 903 transitions, 2002 flow [2025-02-08 05:11:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 854.0) internal successors, (2562), 3 states have internal predecessors, (2562), 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-02-08 05:11:39,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:39,538 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:39,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:11:39,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:39,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 559553662, now seen corresponding path program 1 times [2025-02-08 05:11:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540731537] [2025-02-08 05:11:39,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:39,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-02-08 05:11:39,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-02-08 05:11:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:39,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:39,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-02-08 05:11:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-02-08 05:11:39,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:39,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:39,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:39,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:11:39,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:11:39,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:11:39,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:11:39,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:11:39,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:11:39,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:11:39,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:11:39,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:11:39,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:11:39,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:11:39,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:11:39,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:11:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:11:39,806 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:11:39,806 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:39,806 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:39,863 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:39,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:39,990 INFO L124 PetriNetUnfolderBase]: 8/1031 cut-off events. [2025-02-08 05:11:39,990 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:39,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 1031 events. 8/1031 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1682 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 948. Up to 5 conditions per place. [2025-02-08 05:11:39,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:40,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 998 places, 997 transitions, 2022 flow [2025-02-08 05:11:40,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:40,003 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6abfd0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:40,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:11:40,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:40,034 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-02-08 05:11:40,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:40,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:40,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:40,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:11:40,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash 299935802, now seen corresponding path program 1 times [2025-02-08 05:11:40,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:40,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454341215] [2025-02-08 05:11:40,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-02-08 05:11:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-02-08 05:11:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454341215] [2025-02-08 05:11:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454341215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:41,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:41,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191636845] [2025-02-08 05:11:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:41,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:41,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:41,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:41,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 928 out of 997 [2025-02-08 05:11:41,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 997 transitions, 2022 flow. Second operand has 2 states, 2 states have (on average 929.0) internal successors, (1858), 2 states have internal predecessors, (1858), 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-02-08 05:11:41,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:41,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 928 of 997 [2025-02-08 05:11:41,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:44,929 INFO L124 PetriNetUnfolderBase]: 3368/22167 cut-off events. [2025-02-08 05:11:44,929 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:11:45,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27563 conditions, 22167 events. 3368/22167 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 281993 event pairs, 2768 based on Foata normal form. 2036/21135 useless extension candidates. Maximal degree in co-relation 21526. Up to 4393 conditions per place. [2025-02-08 05:11:45,282 INFO L140 encePairwiseOnDemand]: 952/997 looper letters, 24 selfloop transitions, 0 changer transitions 0/945 dead transitions. [2025-02-08 05:11:45,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 945 transitions, 1966 flow [2025-02-08 05:11:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1925 transitions. [2025-02-08 05:11:45,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9653961885656971 [2025-02-08 05:11:45,286 INFO L175 Difference]: Start difference. First operand has 998 places, 997 transitions, 2022 flow. Second operand 2 states and 1925 transitions. [2025-02-08 05:11:45,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 945 transitions, 1966 flow [2025-02-08 05:11:45,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 945 transitions, 1960 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:45,297 INFO L231 Difference]: Finished difference. Result has 947 places, 945 transitions, 1912 flow [2025-02-08 05:11:45,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=997, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1912, PETRI_PLACES=947, PETRI_TRANSITIONS=945} [2025-02-08 05:11:45,298 INFO L279 CegarLoopForPetriNet]: 998 programPoint places, -51 predicate places. [2025-02-08 05:11:45,298 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 945 transitions, 1912 flow [2025-02-08 05:11:45,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 929.0) internal successors, (1858), 2 states have internal predecessors, (1858), 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-02-08 05:11:45,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:45,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:45,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:11:45,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:11:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash 475653790, now seen corresponding path program 1 times [2025-02-08 05:11:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:45,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606538658] [2025-02-08 05:11:45,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:45,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:45,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:45,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:45,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606538658] [2025-02-08 05:11:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606538658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105217220] [2025-02-08 05:11:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:45,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:45,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 912 out of 997 [2025-02-08 05:11:45,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 945 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 913.3333333333334) internal successors, (2740), 3 states have internal predecessors, (2740), 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-02-08 05:11:45,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:45,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 912 of 997 [2025-02-08 05:11:45,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand