./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-subst.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/chl-simpl-str-subst.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 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:49,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:49,404 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:37:49,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:49,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:49,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:49,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:49,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:49,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:49,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:49,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:49,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:49,431 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:49,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:49,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:49,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:49,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:49,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:49,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:49,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:49,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:49,434 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2025-02-08 05:37:49,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:49,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:49,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:49,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:49,773 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:49,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-02-08 05:37:51,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e9180982/95bd49b5502a41d2bc595c62971929a0/FLAGa5ba84faf [2025-02-08 05:37:51,356 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:51,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-02-08 05:37:51,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e9180982/95bd49b5502a41d2bc595c62971929a0/FLAGa5ba84faf [2025-02-08 05:37:51,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e9180982/95bd49b5502a41d2bc595c62971929a0 [2025-02-08 05:37:51,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:51,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:51,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:51,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:51,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:51,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b533ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51, skipping insertion in model container [2025-02-08 05:37:51,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:51,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:51,605 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:51,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:51,656 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:51,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51 WrapperNode [2025-02-08 05:37:51,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:51,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:51,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:51,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:51,667 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:37:51" (1/1) ... [2025-02-08 05:37:51,676 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:37:51" (1/1) ... [2025-02-08 05:37:51,705 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2025-02-08 05:37:51,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:51,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:51,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:51,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:51,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:51,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:51,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:51,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:51,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (1/1) ... [2025-02-08 05:37:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:51,792 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:37:51,795 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:37:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:51,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:51,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:51,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:51,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:51,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:51,823 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:37:51,911 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:51,913 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:52,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-11: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:37:52,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:37:52,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:52,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:52,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-15: #t~ret1#1 := minus_#res#1; [2025-02-08 05:37:52,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-11: #t~ite6#1 := #t~ret5#1; [2025-02-08 05:37:52,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 05:37:52,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:52,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:52,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-15: #t~ret5#1 := minus_#res#1; [2025-02-08 05:37:52,180 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-11: #t~ite10#1 := #t~ret9#1; [2025-02-08 05:37:52,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:37:52,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:52,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:52,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-15: #t~ret9#1 := minus_#res#1; [2025-02-08 05:37:52,295 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:52,296 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:52,320 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:52,320 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:52,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:52 BoogieIcfgContainer [2025-02-08 05:37:52,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:52,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:52,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:52,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:52,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:51" (1/3) ... [2025-02-08 05:37:52,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa7915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:52, skipping insertion in model container [2025-02-08 05:37:52,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:51" (2/3) ... [2025-02-08 05:37:52,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa7915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:52, skipping insertion in model container [2025-02-08 05:37:52,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:52" (3/3) ... [2025-02-08 05:37:52,336 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-02-08 05:37:52,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:52,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 299 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-02-08 05:37:52,354 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:52,477 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:52,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 310 transitions, 641 flow [2025-02-08 05:37:52,668 INFO L124 PetriNetUnfolderBase]: 12/307 cut-off events. [2025-02-08 05:37:52,671 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:52,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 307 events. 12/307 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 734 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 205. Up to 2 conditions per place. [2025-02-08 05:37:52,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 310 transitions, 641 flow [2025-02-08 05:37:52,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 287 places, 287 transitions, 592 flow [2025-02-08 05:37:52,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:52,721 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;@36554b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:52,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 05:37:52,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:52,750 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:52,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:52,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,751 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] [2025-02-08 05:37:52,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2083907988, now seen corresponding path program 1 times [2025-02-08 05:37:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352825728] [2025-02-08 05:37:52,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:52,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,930 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:37:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352825728] [2025-02-08 05:37:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352825728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944710933] [2025-02-08 05:37:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 310 [2025-02-08 05:37:52,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:52,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 310 [2025-02-08 05:37:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,177 INFO L124 PetriNetUnfolderBase]: 16/604 cut-off events. [2025-02-08 05:37:53,177 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:37:53,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 604 events. 16/604 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3039 event pairs, 7 based on Foata normal form. 22/521 useless extension candidates. Maximal degree in co-relation 474. Up to 25 conditions per place. [2025-02-08 05:37:53,193 INFO L140 encePairwiseOnDemand]: 300/310 looper letters, 11 selfloop transitions, 2 changer transitions 1/279 dead transitions. [2025-02-08 05:37:53,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 602 flow [2025-02-08 05:37:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-02-08 05:37:53,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451612903225807 [2025-02-08 05:37:53,215 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 592 flow. Second operand 3 states and 879 transitions. [2025-02-08 05:37:53,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 602 flow [2025-02-08 05:37:53,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 590 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:53,230 INFO L231 Difference]: Finished difference. Result has 282 places, 278 transitions, 566 flow [2025-02-08 05:37:53,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=282, PETRI_TRANSITIONS=278} [2025-02-08 05:37:53,239 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -5 predicate places. [2025-02-08 05:37:53,241 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 278 transitions, 566 flow [2025-02-08 05:37:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:53,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,242 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] [2025-02-08 05:37:53,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:53,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1329586602, now seen corresponding path program 1 times [2025-02-08 05:37:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881015514] [2025-02-08 05:37:53,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:53,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,317 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:37:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881015514] [2025-02-08 05:37:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881015514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990318395] [2025-02-08 05:37:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 310 [2025-02-08 05:37:53,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 278 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:53,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 310 [2025-02-08 05:37:53,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,453 INFO L124 PetriNetUnfolderBase]: 14/516 cut-off events. [2025-02-08 05:37:53,454 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:53,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 516 events. 14/516 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2368 event pairs, 7 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 520. Up to 25 conditions per place. [2025-02-08 05:37:53,459 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 11 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-08 05:37:53,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 277 transitions, 590 flow [2025-02-08 05:37:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-02-08 05:37:53,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-02-08 05:37:53,463 INFO L175 Difference]: Start difference. First operand has 282 places, 278 transitions, 566 flow. Second operand 3 states and 872 transitions. [2025-02-08 05:37:53,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 277 transitions, 590 flow [2025-02-08 05:37:53,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 277 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,468 INFO L231 Difference]: Finished difference. Result has 280 places, 277 transitions, 564 flow [2025-02-08 05:37:53,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=280, PETRI_TRANSITIONS=277} [2025-02-08 05:37:53,470 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -7 predicate places. [2025-02-08 05:37:53,470 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 277 transitions, 564 flow [2025-02-08 05:37:53,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:53,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,471 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] [2025-02-08 05:37:53,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:53,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:53,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1228222943, now seen corresponding path program 1 times [2025-02-08 05:37:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-02-08 05:37:53,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:37:53,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:37:53,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,513 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:37:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-02-08 05:37:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071046473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831327369] [2025-02-08 05:37:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 310 [2025-02-08 05:37:53,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:37:53,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 310 [2025-02-08 05:37:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,620 INFO L124 PetriNetUnfolderBase]: 14/430 cut-off events. [2025-02-08 05:37:53,620 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:53,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 430 events. 14/430 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1831 event pairs, 8 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 430. Up to 29 conditions per place. [2025-02-08 05:37:53,627 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 12 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:37:53,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 276 transitions, 590 flow [2025-02-08 05:37:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-02-08 05:37:53,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:37:53,632 INFO L175 Difference]: Start difference. First operand has 280 places, 277 transitions, 564 flow. Second operand 3 states and 870 transitions. [2025-02-08 05:37:53,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 276 transitions, 590 flow [2025-02-08 05:37:53,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 276 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,639 INFO L231 Difference]: Finished difference. Result has 279 places, 276 transitions, 562 flow [2025-02-08 05:37:53,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=279, PETRI_TRANSITIONS=276} [2025-02-08 05:37:53,640 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -8 predicate places. [2025-02-08 05:37:53,641 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 276 transitions, 562 flow [2025-02-08 05:37:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:37:53,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,641 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] [2025-02-08 05:37:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:53,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:53,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1050800389, now seen corresponding path program 1 times [2025-02-08 05:37:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427746931] [2025-02-08 05:37:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:37:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:37:53,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427746931] [2025-02-08 05:37:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427746931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966166453] [2025-02-08 05:37:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 310 [2025-02-08 05:37:53,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 276 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:53,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 310 [2025-02-08 05:37:53,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,828 INFO L124 PetriNetUnfolderBase]: 10/399 cut-off events. [2025-02-08 05:37:53,828 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:53,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 399 events. 10/399 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1545 event pairs, 5 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 382. Up to 22 conditions per place. [2025-02-08 05:37:53,834 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 11 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-02-08 05:37:53,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 275 transitions, 586 flow [2025-02-08 05:37:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-02-08 05:37:53,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-02-08 05:37:53,837 INFO L175 Difference]: Start difference. First operand has 279 places, 276 transitions, 562 flow. Second operand 3 states and 872 transitions. [2025-02-08 05:37:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 275 transitions, 586 flow [2025-02-08 05:37:53,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 275 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,842 INFO L231 Difference]: Finished difference. Result has 278 places, 275 transitions, 560 flow [2025-02-08 05:37:53,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=278, PETRI_TRANSITIONS=275} [2025-02-08 05:37:53,843 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -9 predicate places. [2025-02-08 05:37:53,843 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 275 transitions, 560 flow [2025-02-08 05:37:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:53,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,844 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] [2025-02-08 05:37:53,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:53,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1936310785, now seen corresponding path program 1 times [2025-02-08 05:37:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-02-08 05:37:53,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:37:53,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:37:53,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,918 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:37:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-02-08 05:37:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041485546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241874689] [2025-02-08 05:37:53,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 310 [2025-02-08 05:37:53,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 275 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:37:53,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 310 [2025-02-08 05:37:53,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,071 INFO L124 PetriNetUnfolderBase]: 31/678 cut-off events. [2025-02-08 05:37:54,071 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:37:54,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 678 events. 31/678 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3423 event pairs, 20 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 681. Up to 50 conditions per place. [2025-02-08 05:37:54,084 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 13 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-08 05:37:54,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 274 transitions, 588 flow [2025-02-08 05:37:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2025-02-08 05:37:54,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-02-08 05:37:54,087 INFO L175 Difference]: Start difference. First operand has 278 places, 275 transitions, 560 flow. Second operand 3 states and 868 transitions. [2025-02-08 05:37:54,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 274 transitions, 588 flow [2025-02-08 05:37:54,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 274 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,095 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 558 flow [2025-02-08 05:37:54,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2025-02-08 05:37:54,097 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -10 predicate places. [2025-02-08 05:37:54,098 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 558 flow [2025-02-08 05:37:54,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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:37:54,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,099 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] [2025-02-08 05:37:54,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:54,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:54,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1567258073, now seen corresponding path program 1 times [2025-02-08 05:37:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-02-08 05:37:54,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:37:54,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:37:54,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,170 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:37:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243821254] [2025-02-08 05:37:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243821254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914998901] [2025-02-08 05:37:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 310 [2025-02-08 05:37:54,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:54,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 310 [2025-02-08 05:37:54,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,269 INFO L124 PetriNetUnfolderBase]: 11/341 cut-off events. [2025-02-08 05:37:54,269 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-08 05:37:54,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 341 events. 11/341 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1164 event pairs, 7 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 310. Up to 25 conditions per place. [2025-02-08 05:37:54,274 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 11 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-08 05:37:54,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 273 transitions, 582 flow [2025-02-08 05:37:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-02-08 05:37:54,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-02-08 05:37:54,277 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 558 flow. Second operand 3 states and 872 transitions. [2025-02-08 05:37:54,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 273 transitions, 582 flow [2025-02-08 05:37:54,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 273 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,281 INFO L231 Difference]: Finished difference. Result has 276 places, 273 transitions, 556 flow [2025-02-08 05:37:54,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=276, PETRI_TRANSITIONS=273} [2025-02-08 05:37:54,282 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -11 predicate places. [2025-02-08 05:37:54,283 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 273 transitions, 556 flow [2025-02-08 05:37:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 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:37:54,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,283 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] [2025-02-08 05:37:54,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:54,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:54,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1510738442, now seen corresponding path program 1 times [2025-02-08 05:37:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188849635] [2025-02-08 05:37:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:37:54,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:37:54,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,339 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:37:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188849635] [2025-02-08 05:37:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188849635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582286815] [2025-02-08 05:37:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:54,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 273 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:54,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:54,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,480 INFO L124 PetriNetUnfolderBase]: 31/707 cut-off events. [2025-02-08 05:37:54,480 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:54,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 707 events. 31/707 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4053 event pairs, 6 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 698. Up to 43 conditions per place. [2025-02-08 05:37:54,488 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 13 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-02-08 05:37:54,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 275 transitions, 592 flow [2025-02-08 05:37:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-02-08 05:37:54,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473118279569892 [2025-02-08 05:37:54,491 INFO L175 Difference]: Start difference. First operand has 276 places, 273 transitions, 556 flow. Second operand 3 states and 881 transitions. [2025-02-08 05:37:54,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 275 transitions, 592 flow [2025-02-08 05:37:54,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 275 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,496 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 562 flow [2025-02-08 05:37:54,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-02-08 05:37:54,499 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -12 predicate places. [2025-02-08 05:37:54,499 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 562 flow [2025-02-08 05:37:54,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:54,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,500 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] [2025-02-08 05:37:54,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:54,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash -552766344, now seen corresponding path program 1 times [2025-02-08 05:37:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-08 05:37:54,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:37:54,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:37:54,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,572 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:37:54,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-08 05:37:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216845287] [2025-02-08 05:37:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 310 [2025-02-08 05:37:54,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:37:54,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 310 [2025-02-08 05:37:54,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,708 INFO L124 PetriNetUnfolderBase]: 35/905 cut-off events. [2025-02-08 05:37:54,708 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:54,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 905 events. 35/905 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5824 event pairs, 12 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 844. Up to 49 conditions per place. [2025-02-08 05:37:54,720 INFO L140 encePairwiseOnDemand]: 304/310 looper letters, 15 selfloop transitions, 3 changer transitions 0/275 dead transitions. [2025-02-08 05:37:54,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 275 transitions, 604 flow [2025-02-08 05:37:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 876 transitions. [2025-02-08 05:37:54,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-02-08 05:37:54,723 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 562 flow. Second operand 3 states and 876 transitions. [2025-02-08 05:37:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 275 transitions, 604 flow [2025-02-08 05:37:54,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 275 transitions, 604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:54,729 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 577 flow [2025-02-08 05:37:54,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-02-08 05:37:54,730 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -12 predicate places. [2025-02-08 05:37:54,730 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 577 flow [2025-02-08 05:37:54,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:37:54,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,730 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] [2025-02-08 05:37:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:54,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash -556929453, now seen corresponding path program 1 times [2025-02-08 05:37:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646242410] [2025-02-08 05:37:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:37:54,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:37:54,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,807 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:37:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646242410] [2025-02-08 05:37:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646242410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648661428] [2025-02-08 05:37:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:54,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:54,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:54,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,948 INFO L124 PetriNetUnfolderBase]: 31/694 cut-off events. [2025-02-08 05:37:54,949 INFO L125 PetriNetUnfolderBase]: For 3/7 co-relation queries the response was YES. [2025-02-08 05:37:54,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 694 events. 31/694 cut-off events. For 3/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4105 event pairs, 4 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 609. Up to 46 conditions per place. [2025-02-08 05:37:54,961 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 14 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:37:54,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 618 flow [2025-02-08 05:37:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-08 05:37:54,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483870967741935 [2025-02-08 05:37:54,964 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 577 flow. Second operand 3 states and 882 transitions. [2025-02-08 05:37:54,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 618 flow [2025-02-08 05:37:54,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:54,969 INFO L231 Difference]: Finished difference. Result has 276 places, 273 transitions, 587 flow [2025-02-08 05:37:54,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=276, PETRI_TRANSITIONS=273} [2025-02-08 05:37:54,970 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -11 predicate places. [2025-02-08 05:37:54,971 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 273 transitions, 587 flow [2025-02-08 05:37:54,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:54,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:54,972 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1027753227, now seen corresponding path program 1 times [2025-02-08 05:37:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-02-08 05:37:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:37:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:37:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-02-08 05:37:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176457910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810762892] [2025-02-08 05:37:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 310 [2025-02-08 05:37:55,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 273 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 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:37:55,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 310 [2025-02-08 05:37:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,123 INFO L124 PetriNetUnfolderBase]: 20/587 cut-off events. [2025-02-08 05:37:55,124 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:55,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 587 events. 20/587 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3173 event pairs, 4 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 518. Up to 18 conditions per place. [2025-02-08 05:37:55,134 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 11 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-08 05:37:55,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 274 transitions, 617 flow [2025-02-08 05:37:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-02-08 05:37:55,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473118279569892 [2025-02-08 05:37:55,137 INFO L175 Difference]: Start difference. First operand has 276 places, 273 transitions, 587 flow. Second operand 3 states and 881 transitions. [2025-02-08 05:37:55,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 274 transitions, 617 flow [2025-02-08 05:37:55,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 274 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:55,157 INFO L231 Difference]: Finished difference. Result has 277 places, 272 transitions, 589 flow [2025-02-08 05:37:55,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=277, PETRI_TRANSITIONS=272} [2025-02-08 05:37:55,160 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -10 predicate places. [2025-02-08 05:37:55,160 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 272 transitions, 589 flow [2025-02-08 05:37:55,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 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:37:55,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,161 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] [2025-02-08 05:37:55,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:55,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:55,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1661727670, now seen corresponding path program 1 times [2025-02-08 05:37:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286542844] [2025-02-08 05:37:55,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:37:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:37:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,201 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:37:55,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286542844] [2025-02-08 05:37:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286542844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453992658] [2025-02-08 05:37:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:55,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 272 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:55,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:55,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,310 INFO L124 PetriNetUnfolderBase]: 22/621 cut-off events. [2025-02-08 05:37:55,310 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 05:37:55,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 621 events. 22/621 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3226 event pairs, 2 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 593. Up to 32 conditions per place. [2025-02-08 05:37:55,319 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 15 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:37:55,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 276 transitions, 635 flow [2025-02-08 05:37:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2025-02-08 05:37:55,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9494623655913978 [2025-02-08 05:37:55,322 INFO L175 Difference]: Start difference. First operand has 277 places, 272 transitions, 589 flow. Second operand 3 states and 883 transitions. [2025-02-08 05:37:55,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 276 transitions, 635 flow [2025-02-08 05:37:55,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,328 INFO L231 Difference]: Finished difference. Result has 276 places, 272 transitions, 595 flow [2025-02-08 05:37:55,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=276, PETRI_TRANSITIONS=272} [2025-02-08 05:37:55,329 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -11 predicate places. [2025-02-08 05:37:55,329 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 272 transitions, 595 flow [2025-02-08 05:37:55,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 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:37:55,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,330 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] [2025-02-08 05:37:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:55,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -667461222, now seen corresponding path program 1 times [2025-02-08 05:37:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086096615] [2025-02-08 05:37:55,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:37:55,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:37:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,370 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:37:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086096615] [2025-02-08 05:37:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086096615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366318073] [2025-02-08 05:37:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 310 [2025-02-08 05:37:55,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 272 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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:37:55,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 310 [2025-02-08 05:37:55,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,589 INFO L124 PetriNetUnfolderBase]: 161/1779 cut-off events. [2025-02-08 05:37:55,589 INFO L125 PetriNetUnfolderBase]: For 30/36 co-relation queries the response was YES. [2025-02-08 05:37:55,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1779 events. 161/1779 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 15377 event pairs, 66 based on Foata normal form. 1/1582 useless extension candidates. Maximal degree in co-relation 1901. Up to 238 conditions per place. [2025-02-08 05:37:55,607 INFO L140 encePairwiseOnDemand]: 302/310 looper letters, 17 selfloop transitions, 4 changer transitions 0/274 dead transitions. [2025-02-08 05:37:55,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 274 transitions, 643 flow [2025-02-08 05:37:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2025-02-08 05:37:55,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365591397849462 [2025-02-08 05:37:55,610 INFO L175 Difference]: Start difference. First operand has 276 places, 272 transitions, 595 flow. Second operand 3 states and 871 transitions. [2025-02-08 05:37:55,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 274 transitions, 643 flow [2025-02-08 05:37:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:55,615 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 615 flow [2025-02-08 05:37:55,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2025-02-08 05:37:55,616 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -12 predicate places. [2025-02-08 05:37:55,616 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 615 flow [2025-02-08 05:37:55,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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:37:55,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,617 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] [2025-02-08 05:37:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:55,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1099078132, now seen corresponding path program 1 times [2025-02-08 05:37:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612042417] [2025-02-08 05:37:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,659 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:37:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612042417] [2025-02-08 05:37:55,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612042417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237400393] [2025-02-08 05:37:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:55,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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:37:55,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:55,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:55,858 INFO L124 PetriNetUnfolderBase]: 85/1544 cut-off events. [2025-02-08 05:37:55,858 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-02-08 05:37:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1544 events. 85/1544 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12699 event pairs, 14 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1439. Up to 126 conditions per place. [2025-02-08 05:37:55,872 INFO L140 encePairwiseOnDemand]: 306/310 looper letters, 13 selfloop transitions, 2 changer transitions 1/275 dead transitions. [2025-02-08 05:37:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 275 transitions, 656 flow [2025-02-08 05:37:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-08 05:37:55,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483870967741935 [2025-02-08 05:37:55,875 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 615 flow. Second operand 3 states and 882 transitions. [2025-02-08 05:37:55,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 275 transitions, 656 flow [2025-02-08 05:37:55,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:55,880 INFO L231 Difference]: Finished difference. Result has 276 places, 272 transitions, 625 flow [2025-02-08 05:37:55,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=276, PETRI_TRANSITIONS=272} [2025-02-08 05:37:55,882 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -11 predicate places. [2025-02-08 05:37:55,882 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 272 transitions, 625 flow [2025-02-08 05:37:55,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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:37:55,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,883 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] [2025-02-08 05:37:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:55,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash 506408267, now seen corresponding path program 1 times [2025-02-08 05:37:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-02-08 05:37:55,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:37:55,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:37:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,942 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:37:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855620889] [2025-02-08 05:37:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855620889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29652131] [2025-02-08 05:37:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:55,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:55,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:55,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 272 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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:37:55,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:55,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:55,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,134 INFO L124 PetriNetUnfolderBase]: 62/1272 cut-off events. [2025-02-08 05:37:56,135 INFO L125 PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES. [2025-02-08 05:37:56,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 1272 events. 62/1272 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10051 event pairs, 6 based on Foata normal form. 0/1147 useless extension candidates. Maximal degree in co-relation 1153. Up to 50 conditions per place. [2025-02-08 05:37:56,151 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 12 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-08 05:37:56,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 657 flow [2025-02-08 05:37:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-02-08 05:37:56,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451612903225807 [2025-02-08 05:37:56,154 INFO L175 Difference]: Start difference. First operand has 276 places, 272 transitions, 625 flow. Second operand 3 states and 879 transitions. [2025-02-08 05:37:56,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 657 flow [2025-02-08 05:37:56,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 273 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:56,162 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 627 flow [2025-02-08 05:37:56,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-02-08 05:37:56,165 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -10 predicate places. [2025-02-08 05:37:56,165 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 627 flow [2025-02-08 05:37:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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:37:56,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,166 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] [2025-02-08 05:37:56,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:56,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash 927444382, now seen corresponding path program 1 times [2025-02-08 05:37:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051941992] [2025-02-08 05:37:56,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:37:56,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:37:56,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,226 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:37:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051941992] [2025-02-08 05:37:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051941992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122149533] [2025-02-08 05:37:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:56,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 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:37:56,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:56,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,388 INFO L124 PetriNetUnfolderBase]: 59/1049 cut-off events. [2025-02-08 05:37:56,388 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-02-08 05:37:56,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1049 events. 59/1049 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7677 event pairs, 8 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 1223. Up to 47 conditions per place. [2025-02-08 05:37:56,400 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 12 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-08 05:37:56,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 272 transitions, 659 flow [2025-02-08 05:37:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-02-08 05:37:56,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451612903225807 [2025-02-08 05:37:56,403 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 627 flow. Second operand 3 states and 879 transitions. [2025-02-08 05:37:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 272 transitions, 659 flow [2025-02-08 05:37:56,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 272 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:56,407 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 625 flow [2025-02-08 05:37:56,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2025-02-08 05:37:56,408 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -11 predicate places. [2025-02-08 05:37:56,408 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 625 flow [2025-02-08 05:37:56,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 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:37:56,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,409 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] [2025-02-08 05:37:56,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:56,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:56,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash -138278232, now seen corresponding path program 1 times [2025-02-08 05:37:56,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277696751] [2025-02-08 05:37:56,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:37:56,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:37:56,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,460 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:37:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277696751] [2025-02-08 05:37:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277696751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268577513] [2025-02-08 05:37:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 310 [2025-02-08 05:37:56,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 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:37:56,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 310 [2025-02-08 05:37:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,594 INFO L124 PetriNetUnfolderBase]: 54/1216 cut-off events. [2025-02-08 05:37:56,594 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:56,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1216 events. 54/1216 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9254 event pairs, 2 based on Foata normal form. 0/1109 useless extension candidates. Maximal degree in co-relation 1285. Up to 54 conditions per place. [2025-02-08 05:37:56,606 INFO L140 encePairwiseOnDemand]: 308/310 looper letters, 8 selfloop transitions, 1 changer transitions 0/269 dead transitions. [2025-02-08 05:37:56,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 269 transitions, 641 flow [2025-02-08 05:37:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2025-02-08 05:37:56,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9494623655913978 [2025-02-08 05:37:56,609 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 625 flow. Second operand 3 states and 883 transitions. [2025-02-08 05:37:56,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 269 transitions, 641 flow [2025-02-08 05:37:56,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 269 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:56,614 INFO L231 Difference]: Finished difference. Result has 275 places, 269 transitions, 621 flow [2025-02-08 05:37:56,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=275, PETRI_TRANSITIONS=269} [2025-02-08 05:37:56,616 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -12 predicate places. [2025-02-08 05:37:56,616 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 269 transitions, 621 flow [2025-02-08 05:37:56,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 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:37:56,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,617 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] [2025-02-08 05:37:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:56,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:56,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1207836373, now seen corresponding path program 1 times [2025-02-08 05:37:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666647062] [2025-02-08 05:37:56,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:37:56,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:37:56,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,674 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:37:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666647062] [2025-02-08 05:37:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666647062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860481149] [2025-02-08 05:37:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:56,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 269 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:37:56,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:56,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,813 INFO L124 PetriNetUnfolderBase]: 53/1221 cut-off events. [2025-02-08 05:37:56,813 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:56,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1221 events. 53/1221 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9376 event pairs, 3 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 1409. Up to 50 conditions per place. [2025-02-08 05:37:56,825 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 10 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-02-08 05:37:56,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 267 transitions, 639 flow [2025-02-08 05:37:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2025-02-08 05:37:56,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943010752688172 [2025-02-08 05:37:56,860 INFO L175 Difference]: Start difference. First operand has 275 places, 269 transitions, 621 flow. Second operand 3 states and 877 transitions. [2025-02-08 05:37:56,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 267 transitions, 639 flow [2025-02-08 05:37:56,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 267 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:56,864 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 618 flow [2025-02-08 05:37:56,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2025-02-08 05:37:56,865 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -13 predicate places. [2025-02-08 05:37:56,865 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 618 flow [2025-02-08 05:37:56,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:37:56,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,865 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] [2025-02-08 05:37:56,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:56,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-02-08 05:37:56,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 167023804, now seen corresponding path program 1 times [2025-02-08 05:37:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-02-08 05:37:56,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:37:56,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:37:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,918 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:37:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-02-08 05:37:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383796861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896707351] [2025-02-08 05:37:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 310 [2025-02-08 05:37:56,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:37:56,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 310 [2025-02-08 05:37:56,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,026 INFO L124 PetriNetUnfolderBase]: 47/1000 cut-off events. [2025-02-08 05:37:57,026 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 1000 events. 47/1000 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7016 event pairs, 4 based on Foata normal form. 1/914 useless extension candidates. Maximal degree in co-relation 1172. Up to 42 conditions per place. [2025-02-08 05:37:57,034 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 0 selfloop transitions, 0 changer transitions 265/265 dead transitions. [2025-02-08 05:37:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 265 transitions, 634 flow [2025-02-08 05:37:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 876 transitions. [2025-02-08 05:37:57,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-02-08 05:37:57,037 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 618 flow. Second operand 3 states and 876 transitions. [2025-02-08 05:37:57,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 265 transitions, 634 flow [2025-02-08 05:37:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 265 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:57,040 INFO L231 Difference]: Finished difference. Result has 273 places, 0 transitions, 0 flow [2025-02-08 05:37:57,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=273, PETRI_TRANSITIONS=0} [2025-02-08 05:37:57,040 INFO L279 CegarLoopForPetriNet]: 287 programPoint places, -14 predicate places. [2025-02-08 05:37:57,040 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 0 transitions, 0 flow [2025-02-08 05:37:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:37:57,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-02-08 05:37:57,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-02-08 05:37:57,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-02-08 05:37:57,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-02-08 05:37:57,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-02-08 05:37:57,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-02-08 05:37:57,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-02-08 05:37:57,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-02-08 05:37:57,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-02-08 05:37:57,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-02-08 05:37:57,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:57,048 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:57,056 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:57,056 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:57,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:57 BasicIcfg [2025-02-08 05:37:57,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:57,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:57,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:57,063 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:57,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:52" (3/4) ... [2025-02-08 05:37:57,065 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:57,067 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:57,067 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:57,067 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:57,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 05:37:57,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:57,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:57,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:57,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:57,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:57,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:57,161 INFO L158 Benchmark]: Toolchain (without parser) took 5775.62ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 114.1MB in the beginning and 107.9MB in the end (delta: 6.2MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,161 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:57,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.91ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:57,162 INFO L158 Benchmark]: Boogie Preprocessor took 46.11ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,162 INFO L158 Benchmark]: IcfgBuilder took 569.43ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.3MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,162 INFO L158 Benchmark]: TraceAbstraction took 4738.16ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 75.8MB in the beginning and 114.0MB in the end (delta: -38.2MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,162 INFO L158 Benchmark]: Witness Printer took 96.87ms. Allocated memory is still 226.5MB. Free memory was 114.0MB in the beginning and 107.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:57,164 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.34ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.91ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 102.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.11ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 569.43ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 76.3MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4738.16ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 75.8MB in the beginning and 114.0MB in the end (delta: -38.2MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 96.87ms. Allocated memory is still 226.5MB. Free memory was 114.0MB in the beginning and 107.9MB 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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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 - PositiveResult [Line: 80]: 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 - 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 7 procedures, 464 locations, 50 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: 4.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 86 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=14, InterpolantAutomatonStates: 54, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:57,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE