./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c --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/weaver/popl20-bad-counter-queue2.wvr.c -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 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:46,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:46,825 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:39:46,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:46,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:46,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:46,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:46,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:46,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:46,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:46,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:46,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:46,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:46,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:46,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:46,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:46,859 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 -> 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec [2025-02-08 05:39:47,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:47,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:47,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:47,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:47,106 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:47,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-02-08 05:39:48,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739c4213/5e28e4e3da454025a839ac34bb84e3bb/FLAGff2c04be8 [2025-02-08 05:39:48,705 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:48,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-02-08 05:39:48,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739c4213/5e28e4e3da454025a839ac34bb84e3bb/FLAGff2c04be8 [2025-02-08 05:39:48,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f739c4213/5e28e4e3da454025a839ac34bb84e3bb [2025-02-08 05:39:48,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:48,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:48,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:48,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:48,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:48,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:48" (1/1) ... [2025-02-08 05:39:48,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:48, skipping insertion in model container [2025-02-08 05:39:48,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:48" (1/1) ... [2025-02-08 05:39:49,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:49,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:49,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:49,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:49,187 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:49,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49 WrapperNode [2025-02-08 05:39:49,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:49,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:49,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:49,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:49,193 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:39:49" (1/1) ... [2025-02-08 05:39:49,203 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:39:49" (1/1) ... [2025-02-08 05:39:49,218 INFO L138 Inliner]: procedures = 25, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 178 [2025-02-08 05:39:49,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:49,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:49,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:49,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:49,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:49,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:49,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:49,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:49,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (1/1) ... [2025-02-08 05:39:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:49,272 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:39:49,274 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:39:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:49,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:49,298 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:39:49,372 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:49,375 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:49,516 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: havoc #t~post4#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: #t~post4#1 := ~i~0#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: havoc #t~nondet3#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-1: havoc #t~ret2#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: assume #race~counter~0 == #t~nondet3#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: assume !(#race~counter~0 == #t~nondet3#1); [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-3: havoc #t~mem1#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-4: #race~counter~0 := #t~nondet3#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-5: havoc #t~nondet3#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-6: ~counter~0 := #t~ret2#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:39:49,518 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-10: #t~ret2#1 := plus_#res#1; [2025-02-08 05:39:49,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: havoc #t~nondet7#1; [2025-02-08 05:39:49,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-1: havoc #t~ret6#1; [2025-02-08 05:39:49,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: assume #race~counter~0 == #t~nondet7#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: assume !(#race~counter~0 == #t~nondet7#1); [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-3: havoc #t~mem5#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-4: #race~counter~0 := #t~nondet7#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-5: havoc #t~nondet7#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-6: ~counter~0 := #t~ret6#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-7: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-8: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-9: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-10: #t~ret6#1 := minus_#res#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: havoc #t~post8#1; [2025-02-08 05:39:49,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: ~i~1#1 := 1 + #t~post8#1; [2025-02-08 05:39:49,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: #t~post8#1 := ~i~1#1; [2025-02-08 05:39:49,687 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:49,688 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:49,774 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L106 is not an error location. [2025-02-08 05:39:49,775 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L100 is not an error location. [2025-02-08 05:39:49,776 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:49,776 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:49,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:49 BoogieIcfgContainer [2025-02-08 05:39:49,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:49,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:49,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:49,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:49,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:48" (1/3) ... [2025-02-08 05:39:49,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:49, skipping insertion in model container [2025-02-08 05:39:49,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:49" (2/3) ... [2025-02-08 05:39:49,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2e87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:49, skipping insertion in model container [2025-02-08 05:39:49,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:49" (3/3) ... [2025-02-08 05:39:49,784 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2025-02-08 05:39:49,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:49,796 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue2.wvr.c that has 3 procedures, 138 locations, 1 initial locations, 3 loop locations, and 15 error locations. [2025-02-08 05:39:49,797 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:49,847 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:39:49,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 143 transitions, 300 flow [2025-02-08 05:39:49,938 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-02-08 05:39:49,940 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:39:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 141 events. 6/141 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2025-02-08 05:39:49,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 143 transitions, 300 flow [2025-02-08 05:39:49,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 124 transitions, 260 flow [2025-02-08 05:39:49,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:49,965 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;@1fd6417b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:49,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:39:49,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:49,970 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-02-08 05:39:49,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:49,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:49,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:49,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:39:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1558931605, now seen corresponding path program 1 times [2025-02-08 05:39:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092681612] [2025-02-08 05:39:49,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 05:39:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 05:39:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,116 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:39:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092681612] [2025-02-08 05:39:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092681612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220801193] [2025-02-08 05:39:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:50,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:50,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2025-02-08 05:39:50,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:39:50,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:50,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2025-02-08 05:39:50,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:50,242 INFO L124 PetriNetUnfolderBase]: 9/150 cut-off events. [2025-02-08 05:39:50,242 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:39:50,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 150 events. 9/150 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 256 event pairs, 8 based on Foata normal form. 2/135 useless extension candidates. Maximal degree in co-relation 106. Up to 29 conditions per place. [2025-02-08 05:39:50,243 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 12 selfloop transitions, 2 changer transitions 2/113 dead transitions. [2025-02-08 05:39:50,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 266 flow [2025-02-08 05:39:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-02-08 05:39:50,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624708624708625 [2025-02-08 05:39:50,257 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 260 flow. Second operand 3 states and 370 transitions. [2025-02-08 05:39:50,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 266 flow [2025-02-08 05:39:50,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:39:50,265 INFO L231 Difference]: Finished difference. Result has 117 places, 111 transitions, 230 flow [2025-02-08 05:39:50,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=117, PETRI_TRANSITIONS=111} [2025-02-08 05:39:50,270 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -9 predicate places. [2025-02-08 05:39:50,272 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 230 flow [2025-02-08 05:39:50,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:39:50,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:50,273 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] [2025-02-08 05:39:50,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:50,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:39:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1335143648, now seen corresponding path program 1 times [2025-02-08 05:39:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-02-08 05:39:50,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:50,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:39:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:39:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,322 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:39:50,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-02-08 05:39:50,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759411991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:50,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372238503] [2025-02-08 05:39:50,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:50,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:50,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2025-02-08 05:39:50,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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:39:50,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:50,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2025-02-08 05:39:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:50,402 INFO L124 PetriNetUnfolderBase]: 16/168 cut-off events. [2025-02-08 05:39:50,403 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:39:50,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 168 events. 16/168 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 352 event pairs, 15 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 194. Up to 42 conditions per place. [2025-02-08 05:39:50,405 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 10 selfloop transitions, 1 changer transitions 2/108 dead transitions. [2025-02-08 05:39:50,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 250 flow [2025-02-08 05:39:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-02-08 05:39:50,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8414918414918415 [2025-02-08 05:39:50,407 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 230 flow. Second operand 3 states and 361 transitions. [2025-02-08 05:39:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 250 flow [2025-02-08 05:39:50,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:50,411 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 218 flow [2025-02-08 05:39:50,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2025-02-08 05:39:50,412 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -14 predicate places. [2025-02-08 05:39:50,413 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 218 flow [2025-02-08 05:39:50,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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:39:50,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:50,413 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] [2025-02-08 05:39:50,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:50,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:39:50,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash -751595900, now seen corresponding path program 1 times [2025-02-08 05:39:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-02-08 05:39:50,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:39:50,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:39:50,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:50,977 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:39:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-02-08 05:39:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782226344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649537126] [2025-02-08 05:39:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:50,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:51,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2025-02-08 05:39:51,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:39:51,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:51,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2025-02-08 05:39:51,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:51,107 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-02-08 05:39:51,107 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:39:51,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 105 events. 1/105 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 102. Up to 13 conditions per place. [2025-02-08 05:39:51,108 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 12 selfloop transitions, 5 changer transitions 2/105 dead transitions. [2025-02-08 05:39:51,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 250 flow [2025-02-08 05:39:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2025-02-08 05:39:51,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972027972027972 [2025-02-08 05:39:51,110 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 218 flow. Second operand 6 states and 684 transitions. [2025-02-08 05:39:51,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 105 transitions, 250 flow [2025-02-08 05:39:51,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:51,112 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 221 flow [2025-02-08 05:39:51,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2025-02-08 05:39:51,113 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -13 predicate places. [2025-02-08 05:39:51,113 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 221 flow [2025-02-08 05:39:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:39:51,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:51,113 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] [2025-02-08 05:39:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:51,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:39:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1615912541, now seen corresponding path program 1 times [2025-02-08 05:39:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:51,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-02-08 05:39:51,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:51,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:39:51,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:39:51,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:51,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:51,138 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:39:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-02-08 05:39:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078618173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:51,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:51,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741519331] [2025-02-08 05:39:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:51,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:51,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:51,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:51,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 143 [2025-02-08 05:39:51,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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:39:51,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:51,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 143 [2025-02-08 05:39:51,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:51,167 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-02-08 05:39:51,167 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:39:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 102 events. 1/102 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 95. Up to 8 conditions per place. [2025-02-08 05:39:51,168 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 7 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-02-08 05:39:51,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 237 flow [2025-02-08 05:39:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-08 05:39:51,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2025-02-08 05:39:51,171 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 221 flow. Second operand 3 states and 364 transitions. [2025-02-08 05:39:51,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 237 flow [2025-02-08 05:39:51,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 227 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:51,173 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 213 flow [2025-02-08 05:39:51,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-02-08 05:39:51,174 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -19 predicate places. [2025-02-08 05:39:51,175 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 213 flow [2025-02-08 05:39:51,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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:39:51,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:51,176 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] [2025-02-08 05:39:51,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:51,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:39:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash 596843746, now seen corresponding path program 1 times [2025-02-08 05:39:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-02-08 05:39:51,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:51,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:39:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:39:51,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:51,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:51,241 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:39:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-02-08 05:39:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057101998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710331612] [2025-02-08 05:39:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:51,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:51,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:51,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 143 [2025-02-08 05:39:51,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:39:51,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:51,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 143 [2025-02-08 05:39:51,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:51,269 INFO L124 PetriNetUnfolderBase]: 1/101 cut-off events. [2025-02-08 05:39:51,269 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:39:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 101 events. 1/101 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 88. Up to 5 conditions per place. [2025-02-08 05:39:51,270 INFO L140 encePairwiseOnDemand]: 141/143 looper letters, 0 selfloop transitions, 0 changer transitions 101/101 dead transitions. [2025-02-08 05:39:51,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 221 flow [2025-02-08 05:39:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-02-08 05:39:51,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-02-08 05:39:51,274 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 213 flow. Second operand 3 states and 372 transitions. [2025-02-08 05:39:51,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 221 flow [2025-02-08 05:39:51,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:51,275 INFO L231 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2025-02-08 05:39:51,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2025-02-08 05:39:51,276 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -20 predicate places. [2025-02-08 05:39:51,276 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 0 transitions, 0 flow [2025-02-08 05:39:51,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-02-08 05:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-08 05:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-08 05:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-08 05:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-08 05:39:51,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-08 05:39:51,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-08 05:39:51,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-08 05:39:51,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-08 05:39:51,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-08 05:39:51,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-08 05:39:51,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-08 05:39:51,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:51,281 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:39:51,285 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:39:51,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:39:51,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:39:51 BasicIcfg [2025-02-08 05:39:51,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:39:51,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:39:51,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:39:51,289 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:39:51,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:49" (3/4) ... [2025-02-08 05:39:51,290 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:39:51,292 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:39:51,292 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:39:51,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 05:39:51,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:39:51,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:39:51,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:39:51,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:39:51,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:39:51,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:39:51,349 INFO L158 Benchmark]: Toolchain (without parser) took 2360.14ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 91.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2025-02-08 05:39:51,349 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:51,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.84ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 97.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:51,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.95ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:51,349 INFO L158 Benchmark]: Boogie Preprocessor took 17.82ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:51,350 INFO L158 Benchmark]: IcfgBuilder took 538.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 59.0MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:39:51,350 INFO L158 Benchmark]: TraceAbstraction took 1510.62ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 97.5MB in the end (delta: -39.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:39:51,350 INFO L158 Benchmark]: Witness Printer took 59.20ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 91.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:39:51,351 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.84ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 97.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.95ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.82ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 538.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 59.0MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1510.62ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 97.5MB in the end (delta: -39.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.20ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 91.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 170 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 21 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:39:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE