./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.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-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:44,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:44,357 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:44,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:44,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:44,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:44,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:44,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:44,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:44,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:44,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:44,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:44,388 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:44,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:44,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:44,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:44,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:44,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:44,390 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-02-08 05:37:44,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:44,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:44,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:44,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:44,628 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:44,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 05:37:45,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfdb10679/9f2712687d7443e4a8459bc590ee5b73/FLAGca670fdd6 [2025-02-08 05:37:46,043 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:46,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 05:37:46,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfdb10679/9f2712687d7443e4a8459bc590ee5b73/FLAGca670fdd6 [2025-02-08 05:37:46,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfdb10679/9f2712687d7443e4a8459bc590ee5b73 [2025-02-08 05:37:46,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:46,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:46,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:46,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:46,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb39fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46, skipping insertion in model container [2025-02-08 05:37:46,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:46,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,303 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:46,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:46,377 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:46,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46 WrapperNode [2025-02-08 05:37:46,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:46,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:46,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:46,384 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:46" (1/1) ... [2025-02-08 05:37:46,401 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:46" (1/1) ... [2025-02-08 05:37:46,432 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 775 [2025-02-08 05:37:46,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:46,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:46,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:46,443 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:46" (1/1) ... [2025-02-08 05:37:46,443 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:46" (1/1) ... [2025-02-08 05:37:46,447 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:46" (1/1) ... [2025-02-08 05:37:46,448 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:46" (1/1) ... [2025-02-08 05:37:46,471 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:46" (1/1) ... [2025-02-08 05:37:46,477 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:46" (1/1) ... [2025-02-08 05:37:46,480 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:46" (1/1) ... [2025-02-08 05:37:46,482 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:46" (1/1) ... [2025-02-08 05:37:46,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:46,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:46,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:46,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:46,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (1/1) ... [2025-02-08 05:37:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:46,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:46,523 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:46,529 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:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:46,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:46,548 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:46,663 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:46,665 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:46,875 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-24: #t~ite12#1 := #t~ret11#1; [2025-02-08 05:37:46,876 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 05:37:46,876 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:46,876 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:46,876 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-28: #t~ret11#1 := minus_#res#1; [2025-02-08 05:37:47,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-24: #t~ite25#1 := #t~ret24#1; [2025-02-08 05:37:47,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647; [2025-02-08 05:37:47,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-28: #t~ret24#1 := minus_#res#1; [2025-02-08 05:37:47,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-24: #t~ite38#1 := #t~ret37#1; [2025-02-08 05:37:47,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-25: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647; [2025-02-08 05:37:47,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-26: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:47,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-27: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:47,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-28: #t~ret37#1 := minus_#res#1; [2025-02-08 05:37:47,556 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:47,556 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:47,586 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:47,588 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:47,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:47 BoogieIcfgContainer [2025-02-08 05:37:47,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:47,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:47,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:47,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:47,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:46" (1/3) ... [2025-02-08 05:37:47,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caea300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:47, skipping insertion in model container [2025-02-08 05:37:47,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:46" (2/3) ... [2025-02-08 05:37:47,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caea300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:47, skipping insertion in model container [2025-02-08 05:37:47,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:47" (3/3) ... [2025-02-08 05:37:47,617 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-02-08 05:37:47,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:47,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 989 locations, 1 initial locations, 6 loop locations, and 114 error locations. [2025-02-08 05:37:47,630 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:47,776 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 998 places, 1027 transitions, 2075 flow [2025-02-08 05:37:48,097 INFO L124 PetriNetUnfolderBase]: 39/1024 cut-off events. [2025-02-08 05:37:48,101 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 1024 events. 39/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2187 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 839. Up to 2 conditions per place. [2025-02-08 05:37:48,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 998 places, 1027 transitions, 2075 flow [2025-02-08 05:37:48,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 976 places, 1003 transitions, 2024 flow [2025-02-08 05:37:48,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:48,156 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;@7b9920fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:48,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2025-02-08 05:37:48,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:48,163 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:37:48,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:48,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,164 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] [2025-02-08 05:37:48,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1091014360, now seen corresponding path program 1 times [2025-02-08 05:37:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053415373] [2025-02-08 05:37:48,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:37:48,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:37:48,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,330 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:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053415373] [2025-02-08 05:37:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053415373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200440383] [2025-02-08 05:37:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:48,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 980 out of 1027 [2025-02-08 05:37:48,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 1003 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:48,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:48,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 980 of 1027 [2025-02-08 05:37:48,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:48,819 INFO L124 PetriNetUnfolderBase]: 46/1717 cut-off events. [2025-02-08 05:37:48,819 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:37:48,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 1717 events. 46/1717 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7771 event pairs, 21 based on Foata normal form. 53/1469 useless extension candidates. Maximal degree in co-relation 1231. Up to 62 conditions per place. [2025-02-08 05:37:48,850 INFO L140 encePairwiseOnDemand]: 1002/1027 looper letters, 19 selfloop transitions, 2 changer transitions 16/980 dead transitions. [2025-02-08 05:37:48,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 980 transitions, 2020 flow [2025-02-08 05:37:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2984 transitions. [2025-02-08 05:37:48,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685167153521584 [2025-02-08 05:37:48,876 INFO L175 Difference]: Start difference. First operand has 976 places, 1003 transitions, 2024 flow. Second operand 3 states and 2984 transitions. [2025-02-08 05:37:48,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 980 transitions, 2020 flow [2025-02-08 05:37:48,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 980 transitions, 2008 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:48,901 INFO L231 Difference]: Finished difference. Result has 971 places, 964 transitions, 1938 flow [2025-02-08 05:37:48,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=980, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1938, PETRI_PLACES=971, PETRI_TRANSITIONS=964} [2025-02-08 05:37:48,909 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -5 predicate places. [2025-02-08 05:37:48,909 INFO L471 AbstractCegarLoop]: Abstraction has has 971 places, 964 transitions, 1938 flow [2025-02-08 05:37:48,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:48,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:48,911 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] [2025-02-08 05:37:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:48,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1166530488, now seen corresponding path program 1 times [2025-02-08 05:37:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629547120] [2025-02-08 05:37:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:48,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:37:48,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:37:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:48,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:48,980 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:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629547120] [2025-02-08 05:37:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629547120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012840086] [2025-02-08 05:37:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:48,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:48,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:48,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 966 out of 1027 [2025-02-08 05:37:49,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 964 transitions, 1938 flow. Second operand has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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:49,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 966 of 1027 [2025-02-08 05:37:49,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:49,517 INFO L124 PetriNetUnfolderBase]: 99/2448 cut-off events. [2025-02-08 05:37:49,518 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:37:49,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 2448 events. 99/2448 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14591 event pairs, 60 based on Foata normal form. 0/2040 useless extension candidates. Maximal degree in co-relation 2572. Up to 146 conditions per place. [2025-02-08 05:37:49,552 INFO L140 encePairwiseOnDemand]: 1016/1027 looper letters, 26 selfloop transitions, 1 changer transitions 0/954 dead transitions. [2025-02-08 05:37:49,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 954 transitions, 1972 flow [2025-02-08 05:37:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2935 transitions. [2025-02-08 05:37:49,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952612788055826 [2025-02-08 05:37:49,559 INFO L175 Difference]: Start difference. First operand has 971 places, 964 transitions, 1938 flow. Second operand 3 states and 2935 transitions. [2025-02-08 05:37:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 954 transitions, 1972 flow [2025-02-08 05:37:49,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 954 transitions, 1968 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:49,573 INFO L231 Difference]: Finished difference. Result has 945 places, 954 transitions, 1916 flow [2025-02-08 05:37:49,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=953, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=945, PETRI_TRANSITIONS=954} [2025-02-08 05:37:49,575 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -31 predicate places. [2025-02-08 05:37:49,575 INFO L471 AbstractCegarLoop]: Abstraction has has 945 places, 954 transitions, 1916 flow [2025-02-08 05:37:49,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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:49,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:49,577 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] [2025-02-08 05:37:49,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:49,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -282218006, now seen corresponding path program 1 times [2025-02-08 05:37:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880347540] [2025-02-08 05:37:49,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:37:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:37:49,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:49,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:49,633 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:49,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:49,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880347540] [2025-02-08 05:37:49,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880347540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:49,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:49,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603993171] [2025-02-08 05:37:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:49,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:49,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:49,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 980 out of 1027 [2025-02-08 05:37:49,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 954 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:49,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:49,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 980 of 1027 [2025-02-08 05:37:49,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:50,284 INFO L124 PetriNetUnfolderBase]: 76/2596 cut-off events. [2025-02-08 05:37:50,285 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-02-08 05:37:50,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 2596 events. 76/2596 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16057 event pairs, 39 based on Foata normal form. 0/2138 useless extension candidates. Maximal degree in co-relation 2668. Up to 89 conditions per place. [2025-02-08 05:37:50,314 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 19 selfloop transitions, 2 changer transitions 0/953 dead transitions. [2025-02-08 05:37:50,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 953 transitions, 1956 flow [2025-02-08 05:37:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2962 transitions. [2025-02-08 05:37:50,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96137617656605 [2025-02-08 05:37:50,320 INFO L175 Difference]: Start difference. First operand has 945 places, 954 transitions, 1916 flow. Second operand 3 states and 2962 transitions. [2025-02-08 05:37:50,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 953 transitions, 1956 flow [2025-02-08 05:37:50,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 953 transitions, 1955 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:50,330 INFO L231 Difference]: Finished difference. Result has 945 places, 953 transitions, 1917 flow [2025-02-08 05:37:50,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=953, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1917, PETRI_PLACES=945, PETRI_TRANSITIONS=953} [2025-02-08 05:37:50,332 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -31 predicate places. [2025-02-08 05:37:50,332 INFO L471 AbstractCegarLoop]: Abstraction has has 945 places, 953 transitions, 1917 flow [2025-02-08 05:37:50,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:50,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:50,334 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] [2025-02-08 05:37:50,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:50,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1576794760, now seen corresponding path program 1 times [2025-02-08 05:37:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684010075] [2025-02-08 05:37:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:50,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:37:50,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:37:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:50,366 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:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684010075] [2025-02-08 05:37:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684010075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257063023] [2025-02-08 05:37:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:50,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:50,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:50,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 966 out of 1027 [2025-02-08 05:37:50,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 953 transitions, 1917 flow. Second operand has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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:50,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:50,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 966 of 1027 [2025-02-08 05:37:50,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,061 INFO L124 PetriNetUnfolderBase]: 198/3755 cut-off events. [2025-02-08 05:37:51,061 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:37:51,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 3755 events. 198/3755 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28489 event pairs, 132 based on Foata normal form. 0/3129 useless extension candidates. Maximal degree in co-relation 4040. Up to 263 conditions per place. [2025-02-08 05:37:51,104 INFO L140 encePairwiseOnDemand]: 1016/1027 looper letters, 26 selfloop transitions, 1 changer transitions 0/943 dead transitions. [2025-02-08 05:37:51,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 943 transitions, 1951 flow [2025-02-08 05:37:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2935 transitions. [2025-02-08 05:37:51,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952612788055826 [2025-02-08 05:37:51,109 INFO L175 Difference]: Start difference. First operand has 945 places, 953 transitions, 1917 flow. Second operand 3 states and 2935 transitions. [2025-02-08 05:37:51,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 943 transitions, 1951 flow [2025-02-08 05:37:51,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 943 transitions, 1947 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:51,119 INFO L231 Difference]: Finished difference. Result has 935 places, 943 transitions, 1895 flow [2025-02-08 05:37:51,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=935, PETRI_TRANSITIONS=943} [2025-02-08 05:37:51,121 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -41 predicate places. [2025-02-08 05:37:51,121 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 943 transitions, 1895 flow [2025-02-08 05:37:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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:51,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,123 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] [2025-02-08 05:37:51,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:51,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -996750129, now seen corresponding path program 1 times [2025-02-08 05:37:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773143688] [2025-02-08 05:37:51,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:37:51,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:37:51,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,189 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:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773143688] [2025-02-08 05:37:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773143688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502634978] [2025-02-08 05:37:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 980 out of 1027 [2025-02-08 05:37:51,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 943 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:51,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 980 of 1027 [2025-02-08 05:37:51,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:51,613 INFO L124 PetriNetUnfolderBase]: 66/1788 cut-off events. [2025-02-08 05:37:51,613 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-02-08 05:37:51,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1788 events. 66/1788 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8176 event pairs, 39 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 1846. Up to 89 conditions per place. [2025-02-08 05:37:51,642 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 19 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-02-08 05:37:51,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 942 transitions, 1935 flow [2025-02-08 05:37:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2962 transitions. [2025-02-08 05:37:51,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96137617656605 [2025-02-08 05:37:51,651 INFO L175 Difference]: Start difference. First operand has 935 places, 943 transitions, 1895 flow. Second operand 3 states and 2962 transitions. [2025-02-08 05:37:51,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 942 transitions, 1935 flow [2025-02-08 05:37:51,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 942 transitions, 1934 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:51,665 INFO L231 Difference]: Finished difference. Result has 935 places, 942 transitions, 1896 flow [2025-02-08 05:37:51,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1896, PETRI_PLACES=935, PETRI_TRANSITIONS=942} [2025-02-08 05:37:51,667 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -41 predicate places. [2025-02-08 05:37:51,667 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 942 transitions, 1896 flow [2025-02-08 05:37:51,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 981.3333333333334) internal successors, (2944), 3 states have internal predecessors, (2944), 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:51,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:51,669 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] [2025-02-08 05:37:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:51,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash -764364116, now seen corresponding path program 1 times [2025-02-08 05:37:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648651502] [2025-02-08 05:37:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:51,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:37:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:37:51,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:51,709 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:51,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648651502] [2025-02-08 05:37:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648651502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:51,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445489567] [2025-02-08 05:37:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:51,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:51,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:51,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 966 out of 1027 [2025-02-08 05:37:51,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 942 transitions, 1896 flow. Second operand has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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:51,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:51,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 966 of 1027 [2025-02-08 05:37:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,492 INFO L124 PetriNetUnfolderBase]: 201/3493 cut-off events. [2025-02-08 05:37:52,492 INFO L125 PetriNetUnfolderBase]: For 64/93 co-relation queries the response was YES. [2025-02-08 05:37:52,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3783 conditions, 3493 events. 201/3493 cut-off events. For 64/93 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25148 event pairs, 132 based on Foata normal form. 0/2949 useless extension candidates. Maximal degree in co-relation 3741. Up to 273 conditions per place. [2025-02-08 05:37:52,525 INFO L140 encePairwiseOnDemand]: 1016/1027 looper letters, 26 selfloop transitions, 1 changer transitions 0/932 dead transitions. [2025-02-08 05:37:52,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 932 transitions, 1930 flow [2025-02-08 05:37:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2935 transitions. [2025-02-08 05:37:52,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952612788055826 [2025-02-08 05:37:52,530 INFO L175 Difference]: Start difference. First operand has 935 places, 942 transitions, 1896 flow. Second operand 3 states and 2935 transitions. [2025-02-08 05:37:52,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 932 transitions, 1930 flow [2025-02-08 05:37:52,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 932 transitions, 1926 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:52,541 INFO L231 Difference]: Finished difference. Result has 925 places, 932 transitions, 1874 flow [2025-02-08 05:37:52,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1874, PETRI_PLACES=925, PETRI_TRANSITIONS=932} [2025-02-08 05:37:52,543 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -51 predicate places. [2025-02-08 05:37:52,543 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 932 transitions, 1874 flow [2025-02-08 05:37:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 967.0) internal successors, (2901), 3 states have internal predecessors, (2901), 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,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,545 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:52,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:52,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:52,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1024068847, now seen corresponding path program 1 times [2025-02-08 05:37:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159974458] [2025-02-08 05:37:52,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:37:52,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:37:52,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,597 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,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159974458] [2025-02-08 05:37:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159974458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111725190] [2025-02-08 05:37:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:37:52,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 932 transitions, 1874 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:37:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:52,757 INFO L124 PetriNetUnfolderBase]: 21/1222 cut-off events. [2025-02-08 05:37:52,757 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:52,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 1222 events. 21/1222 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3226 event pairs, 2 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1207. Up to 16 conditions per place. [2025-02-08 05:37:52,770 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/931 dead transitions. [2025-02-08 05:37:52,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 931 transitions, 1898 flow [2025-02-08 05:37:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:37:52,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:37:52,775 INFO L175 Difference]: Start difference. First operand has 925 places, 932 transitions, 1874 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:37:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 931 transitions, 1898 flow [2025-02-08 05:37:52,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 931 transitions, 1897 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:52,785 INFO L231 Difference]: Finished difference. Result has 925 places, 931 transitions, 1875 flow [2025-02-08 05:37:52,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=925, PETRI_TRANSITIONS=931} [2025-02-08 05:37:52,787 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -51 predicate places. [2025-02-08 05:37:52,787 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 931 transitions, 1875 flow [2025-02-08 05:37:52,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:52,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:52,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:52,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:52,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2005533143, now seen corresponding path program 1 times [2025-02-08 05:37:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:52,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742872833] [2025-02-08 05:37:52,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:37:52,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:37:52,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:52,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:52,837 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,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742872833] [2025-02-08 05:37:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742872833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407348179] [2025-02-08 05:37:52,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:52,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:52,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:52,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:52,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:52,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 931 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:52,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:52,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,097 INFO L124 PetriNetUnfolderBase]: 33/1803 cut-off events. [2025-02-08 05:37:53,097 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1803 events. 33/1803 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8087 event pairs, 6 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 1803. Up to 25 conditions per place. [2025-02-08 05:37:53,121 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-02-08 05:37:53,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 930 transitions, 1901 flow [2025-02-08 05:37:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:53,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:53,126 INFO L175 Difference]: Start difference. First operand has 925 places, 931 transitions, 1875 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:53,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 930 transitions, 1901 flow [2025-02-08 05:37:53,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 930 transitions, 1897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,172 INFO L231 Difference]: Finished difference. Result has 924 places, 930 transitions, 1873 flow [2025-02-08 05:37:53,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=924, PETRI_TRANSITIONS=930} [2025-02-08 05:37:53,174 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -52 predicate places. [2025-02-08 05:37:53,174 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 930 transitions, 1873 flow [2025-02-08 05:37:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,176 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:53,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:53,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1914033156, now seen corresponding path program 1 times [2025-02-08 05:37:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757305286] [2025-02-08 05:37:53,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:37:53,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:37:53,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,208 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,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757305286] [2025-02-08 05:37:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757305286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066807150] [2025-02-08 05:37:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:53,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 930 transitions, 1873 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:53,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,454 INFO L124 PetriNetUnfolderBase]: 33/1802 cut-off events. [2025-02-08 05:37:53,454 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-08 05:37:53,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 1802 events. 33/1802 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8055 event pairs, 6 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 1802. Up to 25 conditions per place. [2025-02-08 05:37:53,476 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/929 dead transitions. [2025-02-08 05:37:53,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 929 transitions, 1899 flow [2025-02-08 05:37:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:53,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:53,481 INFO L175 Difference]: Start difference. First operand has 924 places, 930 transitions, 1873 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:53,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 929 transitions, 1899 flow [2025-02-08 05:37:53,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 929 transitions, 1895 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,491 INFO L231 Difference]: Finished difference. Result has 923 places, 929 transitions, 1871 flow [2025-02-08 05:37:53,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1871, PETRI_PLACES=923, PETRI_TRANSITIONS=929} [2025-02-08 05:37:53,493 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -53 predicate places. [2025-02-08 05:37:53,493 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 929 transitions, 1871 flow [2025-02-08 05:37:53,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,495 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] [2025-02-08 05:37:53,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:53,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:53,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -298095464, now seen corresponding path program 1 times [2025-02-08 05:37:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4914370] [2025-02-08 05:37:53,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:37:53,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:37:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,542 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,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4914370] [2025-02-08 05:37:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4914370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271717735] [2025-02-08 05:37:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:37:53,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 929 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:37:53,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,686 INFO L124 PetriNetUnfolderBase]: 19/1074 cut-off events. [2025-02-08 05:37:53,686 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:37:53,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 1074 events. 19/1074 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2485 event pairs, 2 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1060. Up to 16 conditions per place. [2025-02-08 05:37:53,700 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/928 dead transitions. [2025-02-08 05:37:53,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 928 transitions, 1895 flow [2025-02-08 05:37:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:37:53,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:37:53,704 INFO L175 Difference]: Start difference. First operand has 923 places, 929 transitions, 1871 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:37:53,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 928 transitions, 1895 flow [2025-02-08 05:37:53,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 928 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:53,715 INFO L231 Difference]: Finished difference. Result has 922 places, 928 transitions, 1869 flow [2025-02-08 05:37:53,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1869, PETRI_PLACES=922, PETRI_TRANSITIONS=928} [2025-02-08 05:37:53,716 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -54 predicate places. [2025-02-08 05:37:53,716 INFO L471 AbstractCegarLoop]: Abstraction has has 922 places, 928 transitions, 1869 flow [2025-02-08 05:37:53,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:53,718 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] [2025-02-08 05:37:53,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:53,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:53,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash -756732433, now seen corresponding path program 1 times [2025-02-08 05:37:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077304081] [2025-02-08 05:37:53,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:53,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:37:53,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:37:53,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:53,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:53,749 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,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077304081] [2025-02-08 05:37:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077304081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269029800] [2025-02-08 05:37:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:53,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:53,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:53,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:53,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:53,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:53,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 928 transitions, 1869 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:53,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:53,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:53,979 INFO L124 PetriNetUnfolderBase]: 27/1365 cut-off events. [2025-02-08 05:37:53,979 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-02-08 05:37:53,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1365 events. 27/1365 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4766 event pairs, 6 based on Foata normal form. 0/1189 useless extension candidates. Maximal degree in co-relation 1362. Up to 25 conditions per place. [2025-02-08 05:37:53,992 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/927 dead transitions. [2025-02-08 05:37:53,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 927 transitions, 1895 flow [2025-02-08 05:37:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:53,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:53,995 INFO L175 Difference]: Start difference. First operand has 922 places, 928 transitions, 1869 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:53,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 927 transitions, 1895 flow [2025-02-08 05:37:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 927 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,009 INFO L231 Difference]: Finished difference. Result has 921 places, 927 transitions, 1867 flow [2025-02-08 05:37:54,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=921, PETRI_TRANSITIONS=927} [2025-02-08 05:37:54,011 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -55 predicate places. [2025-02-08 05:37:54,011 INFO L471 AbstractCegarLoop]: Abstraction has has 921 places, 927 transitions, 1867 flow [2025-02-08 05:37:54,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,013 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] [2025-02-08 05:37:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:54,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1209331427, now seen corresponding path program 1 times [2025-02-08 05:37:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794403765] [2025-02-08 05:37:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:37:54,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:37:54,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,073 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,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794403765] [2025-02-08 05:37:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794403765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75970313] [2025-02-08 05:37:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:54,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 927 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,278 INFO L124 PetriNetUnfolderBase]: 27/1364 cut-off events. [2025-02-08 05:37:54,278 INFO L125 PetriNetUnfolderBase]: For 4/28 co-relation queries the response was YES. [2025-02-08 05:37:54,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 1364 events. 27/1364 cut-off events. For 4/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4768 event pairs, 6 based on Foata normal form. 0/1190 useless extension candidates. Maximal degree in co-relation 1361. Up to 25 conditions per place. [2025-02-08 05:37:54,296 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-02-08 05:37:54,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 926 transitions, 1893 flow [2025-02-08 05:37:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:54,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:54,300 INFO L175 Difference]: Start difference. First operand has 921 places, 927 transitions, 1867 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:54,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 926 transitions, 1893 flow [2025-02-08 05:37:54,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 926 transitions, 1889 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,310 INFO L231 Difference]: Finished difference. Result has 920 places, 926 transitions, 1865 flow [2025-02-08 05:37:54,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1865, PETRI_PLACES=920, PETRI_TRANSITIONS=926} [2025-02-08 05:37:54,312 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -56 predicate places. [2025-02-08 05:37:54,312 INFO L471 AbstractCegarLoop]: Abstraction has has 920 places, 926 transitions, 1865 flow [2025-02-08 05:37:54,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,314 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] [2025-02-08 05:37:54,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:54,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:54,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 617434629, now seen corresponding path program 1 times [2025-02-08 05:37:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590795703] [2025-02-08 05:37:54,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 05:37:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 05:37:54,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,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:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590795703] [2025-02-08 05:37:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590795703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390712212] [2025-02-08 05:37:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:37:54,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 926 transitions, 1865 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:37:54,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,487 INFO L124 PetriNetUnfolderBase]: 17/955 cut-off events. [2025-02-08 05:37:54,487 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:54,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 955 events. 17/955 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2019 event pairs, 2 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 940. Up to 16 conditions per place. [2025-02-08 05:37:54,497 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/925 dead transitions. [2025-02-08 05:37:54,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 925 transitions, 1889 flow [2025-02-08 05:37:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:37:54,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:37:54,501 INFO L175 Difference]: Start difference. First operand has 920 places, 926 transitions, 1865 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:37:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 925 transitions, 1889 flow [2025-02-08 05:37:54,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 925 transitions, 1885 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,512 INFO L231 Difference]: Finished difference. Result has 919 places, 925 transitions, 1863 flow [2025-02-08 05:37:54,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1863, PETRI_PLACES=919, PETRI_TRANSITIONS=925} [2025-02-08 05:37:54,514 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -57 predicate places. [2025-02-08 05:37:54,514 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 925 transitions, 1863 flow [2025-02-08 05:37:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,515 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] [2025-02-08 05:37:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:54,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:54,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 323936464, now seen corresponding path program 1 times [2025-02-08 05:37:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439895929] [2025-02-08 05:37:54,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-08 05:37:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 05:37:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,561 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,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439895929] [2025-02-08 05:37:54,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439895929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707274618] [2025-02-08 05:37:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:54,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 925 transitions, 1863 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:54,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,717 INFO L124 PetriNetUnfolderBase]: 25/1180 cut-off events. [2025-02-08 05:37:54,717 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:37:54,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 1180 events. 25/1180 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3012 event pairs, 6 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1174. Up to 25 conditions per place. [2025-02-08 05:37:54,731 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/924 dead transitions. [2025-02-08 05:37:54,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 924 transitions, 1889 flow [2025-02-08 05:37:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:54,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:54,737 INFO L175 Difference]: Start difference. First operand has 919 places, 925 transitions, 1863 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:54,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 924 transitions, 1889 flow [2025-02-08 05:37:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 924 transitions, 1885 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:54,747 INFO L231 Difference]: Finished difference. Result has 918 places, 924 transitions, 1861 flow [2025-02-08 05:37:54,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1861, PETRI_PLACES=918, PETRI_TRANSITIONS=924} [2025-02-08 05:37:54,749 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -58 predicate places. [2025-02-08 05:37:54,749 INFO L471 AbstractCegarLoop]: Abstraction has has 918 places, 924 transitions, 1861 flow [2025-02-08 05:37:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,750 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] [2025-02-08 05:37:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:54,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 674288343, now seen corresponding path program 1 times [2025-02-08 05:37:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935304618] [2025-02-08 05:37:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 05:37:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 05:37:54,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,790 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,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935304618] [2025-02-08 05:37:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935304618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772384880] [2025-02-08 05:37:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1027 [2025-02-08 05:37:54,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 924 transitions, 1861 flow. Second operand has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1027 [2025-02-08 05:37:54,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:54,994 INFO L124 PetriNetUnfolderBase]: 25/1141 cut-off events. [2025-02-08 05:37:54,995 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-02-08 05:37:55,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 1141 events. 25/1141 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2876 event pairs, 6 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1135. Up to 25 conditions per place. [2025-02-08 05:37:55,009 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 12 selfloop transitions, 2 changer transitions 0/923 dead transitions. [2025-02-08 05:37:55,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 923 transitions, 1887 flow [2025-02-08 05:37:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2976 transitions. [2025-02-08 05:37:55,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659201557935735 [2025-02-08 05:37:55,014 INFO L175 Difference]: Start difference. First operand has 918 places, 924 transitions, 1861 flow. Second operand 3 states and 2976 transitions. [2025-02-08 05:37:55,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 923 transitions, 1887 flow [2025-02-08 05:37:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 923 transitions, 1883 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:55,027 INFO L231 Difference]: Finished difference. Result has 917 places, 923 transitions, 1859 flow [2025-02-08 05:37:55,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=917, PETRI_TRANSITIONS=923} [2025-02-08 05:37:55,029 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -59 predicate places. [2025-02-08 05:37:55,029 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 923 transitions, 1859 flow [2025-02-08 05:37:55,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.3333333333334) internal successors, (2965), 3 states have internal predecessors, (2965), 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,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:55,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:55,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:55,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:37:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1737957002, now seen corresponding path program 1 times [2025-02-08 05:37:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209617715] [2025-02-08 05:37:55,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:55,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 05:37:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 05:37:55,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:55,672 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,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209617715] [2025-02-08 05:37:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209617715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:55,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501076622] [2025-02-08 05:37:55,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:55,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:55,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:55,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:56,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 898 out of 1027 [2025-02-08 05:37:56,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 923 transitions, 1859 flow. Second operand has 6 states, 6 states have (on average 899.5) internal successors, (5397), 6 states have internal predecessors, (5397), 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,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 898 of 1027 [2025-02-08 05:37:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:06,873 INFO L124 PetriNetUnfolderBase]: 14629/69457 cut-off events. [2025-02-08 05:38:06,873 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-02-08 05:38:07,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91548 conditions, 69457 events. 14629/69457 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 984522 event pairs, 14040 based on Foata normal form. 0/59579 useless extension candidates. Maximal degree in co-relation 91506. Up to 21688 conditions per place. [2025-02-08 05:38:07,306 INFO L140 encePairwiseOnDemand]: 1009/1027 looper letters, 87 selfloop transitions, 15 changer transitions 0/920 dead transitions. [2025-02-08 05:38:07,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 920 transitions, 2057 flow [2025-02-08 05:38:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5493 transitions. [2025-02-08 05:38:07,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8914313534566699 [2025-02-08 05:38:07,316 INFO L175 Difference]: Start difference. First operand has 917 places, 923 transitions, 1859 flow. Second operand 6 states and 5493 transitions. [2025-02-08 05:38:07,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 920 transitions, 2057 flow [2025-02-08 05:38:07,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 920 transitions, 2053 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:07,327 INFO L231 Difference]: Finished difference. Result has 917 places, 920 transitions, 1879 flow [2025-02-08 05:38:07,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=912, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1879, PETRI_PLACES=917, PETRI_TRANSITIONS=920} [2025-02-08 05:38:07,328 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -59 predicate places. [2025-02-08 05:38:07,328 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 920 transitions, 1879 flow [2025-02-08 05:38:07,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 899.5) internal successors, (5397), 6 states have internal predecessors, (5397), 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:38:07,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:07,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:07,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1746711014, now seen corresponding path program 1 times [2025-02-08 05:38:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609983885] [2025-02-08 05:38:07,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 05:38:07,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 05:38:07,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,389 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:38:07,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609983885] [2025-02-08 05:38:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609983885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080906528] [2025-02-08 05:38:07,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1027 [2025-02-08 05:38:07,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 920 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:07,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1027 [2025-02-08 05:38:07,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,707 INFO L124 PetriNetUnfolderBase]: 35/1491 cut-off events. [2025-02-08 05:38:07,707 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:07,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1491 events. 35/1491 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6207 event pairs, 12 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1515. Up to 38 conditions per place. [2025-02-08 05:38:07,728 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 13 selfloop transitions, 2 changer transitions 0/919 dead transitions. [2025-02-08 05:38:07,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 918 places, 919 transitions, 1907 flow [2025-02-08 05:38:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2974 transitions. [2025-02-08 05:38:07,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652710159039273 [2025-02-08 05:38:07,732 INFO L175 Difference]: Start difference. First operand has 917 places, 920 transitions, 1879 flow. Second operand 3 states and 2974 transitions. [2025-02-08 05:38:07,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 918 places, 919 transitions, 1907 flow [2025-02-08 05:38:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 919 transitions, 1877 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:07,744 INFO L231 Difference]: Finished difference. Result has 913 places, 919 transitions, 1851 flow [2025-02-08 05:38:07,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=913, PETRI_TRANSITIONS=919} [2025-02-08 05:38:07,745 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -63 predicate places. [2025-02-08 05:38:07,745 INFO L471 AbstractCegarLoop]: Abstraction has has 913 places, 919 transitions, 1851 flow [2025-02-08 05:38:07,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:07,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:07,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:07,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1678464216, now seen corresponding path program 1 times [2025-02-08 05:38:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011537919] [2025-02-08 05:38:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:07,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:38:07,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:38:07,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:07,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:07,808 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:38:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011537919] [2025-02-08 05:38:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011537919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571190588] [2025-02-08 05:38:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:07,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:07,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1027 [2025-02-08 05:38:07,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 919 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:07,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:07,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1027 [2025-02-08 05:38:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,222 INFO L124 PetriNetUnfolderBase]: 51/2072 cut-off events. [2025-02-08 05:38:08,222 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-08 05:38:08,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 2072 events. 51/2072 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10595 event pairs, 20 based on Foata normal form. 0/1778 useless extension candidates. Maximal degree in co-relation 2101. Up to 50 conditions per place. [2025-02-08 05:38:08,249 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 13 selfloop transitions, 2 changer transitions 0/918 dead transitions. [2025-02-08 05:38:08,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 918 transitions, 1879 flow [2025-02-08 05:38:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2974 transitions. [2025-02-08 05:38:08,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652710159039273 [2025-02-08 05:38:08,253 INFO L175 Difference]: Start difference. First operand has 913 places, 919 transitions, 1851 flow. Second operand 3 states and 2974 transitions. [2025-02-08 05:38:08,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 918 transitions, 1879 flow [2025-02-08 05:38:08,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 918 transitions, 1875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:08,264 INFO L231 Difference]: Finished difference. Result has 912 places, 918 transitions, 1849 flow [2025-02-08 05:38:08,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1849, PETRI_PLACES=912, PETRI_TRANSITIONS=918} [2025-02-08 05:38:08,265 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -64 predicate places. [2025-02-08 05:38:08,265 INFO L471 AbstractCegarLoop]: Abstraction has has 912 places, 918 transitions, 1849 flow [2025-02-08 05:38:08,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:08,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:08,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2002008379, now seen corresponding path program 1 times [2025-02-08 05:38:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676503161] [2025-02-08 05:38:08,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 05:38:08,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 05:38:08,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,323 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:38:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676503161] [2025-02-08 05:38:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676503161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476326399] [2025-02-08 05:38:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:08,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1027 [2025-02-08 05:38:08,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 918 transitions, 1849 flow. Second operand has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:08,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:08,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1027 [2025-02-08 05:38:08,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:08,686 INFO L124 PetriNetUnfolderBase]: 45/1587 cut-off events. [2025-02-08 05:38:08,686 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-02-08 05:38:08,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 1587 events. 45/1587 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5935 event pairs, 20 based on Foata normal form. 0/1381 useless extension candidates. Maximal degree in co-relation 1608. Up to 50 conditions per place. [2025-02-08 05:38:08,698 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 13 selfloop transitions, 2 changer transitions 0/917 dead transitions. [2025-02-08 05:38:08,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 917 transitions, 1877 flow [2025-02-08 05:38:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2974 transitions. [2025-02-08 05:38:08,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652710159039273 [2025-02-08 05:38:08,701 INFO L175 Difference]: Start difference. First operand has 912 places, 918 transitions, 1849 flow. Second operand 3 states and 2974 transitions. [2025-02-08 05:38:08,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 917 transitions, 1877 flow [2025-02-08 05:38:08,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 917 transitions, 1873 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:08,709 INFO L231 Difference]: Finished difference. Result has 911 places, 917 transitions, 1847 flow [2025-02-08 05:38:08,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1847, PETRI_PLACES=911, PETRI_TRANSITIONS=917} [2025-02-08 05:38:08,710 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -65 predicate places. [2025-02-08 05:38:08,710 INFO L471 AbstractCegarLoop]: Abstraction has has 911 places, 917 transitions, 1847 flow [2025-02-08 05:38:08,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 987.3333333333334) internal successors, (2962), 3 states have internal predecessors, (2962), 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:38:08,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:08,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:08,711 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:08,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1761513998, now seen corresponding path program 1 times [2025-02-08 05:38:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843037380] [2025-02-08 05:38:08,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-08 05:38:08,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-08 05:38:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,825 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:38:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843037380] [2025-02-08 05:38:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843037380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196444546] [2025-02-08 05:38:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:09,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 898 out of 1027 [2025-02-08 05:38:09,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 917 transitions, 1847 flow. Second operand has 3 states, 3 states have (on average 900.0) internal successors, (2700), 3 states have internal predecessors, (2700), 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:38:09,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:09,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 898 of 1027 [2025-02-08 05:38:09,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:19,210 INFO L124 PetriNetUnfolderBase]: 14629/69451 cut-off events. [2025-02-08 05:38:19,211 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-02-08 05:38:19,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91542 conditions, 69451 events. 14629/69451 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 985239 event pairs, 14040 based on Foata normal form. 0/59579 useless extension candidates. Maximal degree in co-relation 91500. Up to 21697 conditions per place. [2025-02-08 05:38:19,596 INFO L140 encePairwiseOnDemand]: 1018/1027 looper letters, 96 selfloop transitions, 6 changer transitions 0/914 dead transitions. [2025-02-08 05:38:19,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 914 transitions, 2045 flow [2025-02-08 05:38:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2799 transitions. [2025-02-08 05:38:19,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9084712755598832 [2025-02-08 05:38:19,599 INFO L175 Difference]: Start difference. First operand has 911 places, 917 transitions, 1847 flow. Second operand 3 states and 2799 transitions. [2025-02-08 05:38:19,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 914 transitions, 2045 flow [2025-02-08 05:38:19,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 908 places, 914 transitions, 2041 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:19,606 INFO L231 Difference]: Finished difference. Result has 908 places, 914 transitions, 1849 flow [2025-02-08 05:38:19,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=906, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1849, PETRI_PLACES=908, PETRI_TRANSITIONS=914} [2025-02-08 05:38:19,607 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -68 predicate places. [2025-02-08 05:38:19,607 INFO L471 AbstractCegarLoop]: Abstraction has has 908 places, 914 transitions, 1849 flow [2025-02-08 05:38:19,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 900.0) internal successors, (2700), 3 states have internal predecessors, (2700), 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:38:19,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:19,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:19,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:19,608 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -422623456, now seen corresponding path program 1 times [2025-02-08 05:38:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949781116] [2025-02-08 05:38:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:19,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-08 05:38:19,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-08 05:38:19,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:19,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:19,658 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:38:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949781116] [2025-02-08 05:38:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949781116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:19,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627485236] [2025-02-08 05:38:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:19,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:19,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:19,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:19,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:38:19,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 914 transitions, 1849 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:19,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:19,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:38:19,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,014 INFO L124 PetriNetUnfolderBase]: 24/1209 cut-off events. [2025-02-08 05:38:20,014 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-02-08 05:38:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 1209 events. 24/1209 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3790 event pairs, 5 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 1219. Up to 22 conditions per place. [2025-02-08 05:38:20,029 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/913 dead transitions. [2025-02-08 05:38:20,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 913 transitions, 1873 flow [2025-02-08 05:38:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:38:20,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:38:20,035 INFO L175 Difference]: Start difference. First operand has 908 places, 914 transitions, 1849 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:38:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 913 transitions, 1873 flow [2025-02-08 05:38:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 913 transitions, 1861 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,046 INFO L231 Difference]: Finished difference. Result has 907 places, 913 transitions, 1839 flow [2025-02-08 05:38:20,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=907, PETRI_TRANSITIONS=913} [2025-02-08 05:38:20,048 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -69 predicate places. [2025-02-08 05:38:20,048 INFO L471 AbstractCegarLoop]: Abstraction has has 907 places, 913 transitions, 1839 flow [2025-02-08 05:38:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:20,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:20,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 410727340, now seen corresponding path program 1 times [2025-02-08 05:38:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530346502] [2025-02-08 05:38:20,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-08 05:38:20,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-08 05:38:20,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,129 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:38:20,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530346502] [2025-02-08 05:38:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530346502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897731178] [2025-02-08 05:38:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:38:20,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 913 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:20,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:38:20,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,397 INFO L124 PetriNetUnfolderBase]: 30/1495 cut-off events. [2025-02-08 05:38:20,397 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-02-08 05:38:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1495 events. 30/1495 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5420 event pairs, 7 based on Foata normal form. 0/1309 useless extension candidates. Maximal degree in co-relation 1493. Up to 25 conditions per place. [2025-02-08 05:38:20,413 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/912 dead transitions. [2025-02-08 05:38:20,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 912 transitions, 1863 flow [2025-02-08 05:38:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:38:20,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:38:20,416 INFO L175 Difference]: Start difference. First operand has 907 places, 913 transitions, 1839 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:38:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 912 transitions, 1863 flow [2025-02-08 05:38:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 912 transitions, 1859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,426 INFO L231 Difference]: Finished difference. Result has 906 places, 912 transitions, 1837 flow [2025-02-08 05:38:20,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1837, PETRI_PLACES=906, PETRI_TRANSITIONS=912} [2025-02-08 05:38:20,427 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -70 predicate places. [2025-02-08 05:38:20,427 INFO L471 AbstractCegarLoop]: Abstraction has has 906 places, 912 transitions, 1837 flow [2025-02-08 05:38:20,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:20,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:20,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:20,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:20,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash -891660851, now seen corresponding path program 1 times [2025-02-08 05:38:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840311077] [2025-02-08 05:38:20,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-08 05:38:20,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-08 05:38:20,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,506 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:38:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840311077] [2025-02-08 05:38:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840311077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768439502] [2025-02-08 05:38:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 988 out of 1027 [2025-02-08 05:38:20,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 912 transitions, 1837 flow. Second operand has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:20,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 988 of 1027 [2025-02-08 05:38:20,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:20,757 INFO L124 PetriNetUnfolderBase]: 27/1242 cut-off events. [2025-02-08 05:38:20,757 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:38:20,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1242 events. 27/1242 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3512 event pairs, 7 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 1238. Up to 26 conditions per place. [2025-02-08 05:38:20,773 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 11 selfloop transitions, 2 changer transitions 0/911 dead transitions. [2025-02-08 05:38:20,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 911 transitions, 1861 flow [2025-02-08 05:38:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2978 transitions. [2025-02-08 05:38:20,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9665692956832197 [2025-02-08 05:38:20,776 INFO L175 Difference]: Start difference. First operand has 906 places, 912 transitions, 1837 flow. Second operand 3 states and 2978 transitions. [2025-02-08 05:38:20,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 911 transitions, 1861 flow [2025-02-08 05:38:20,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 911 transitions, 1857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:20,787 INFO L231 Difference]: Finished difference. Result has 905 places, 911 transitions, 1835 flow [2025-02-08 05:38:20,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1835, PETRI_PLACES=905, PETRI_TRANSITIONS=911} [2025-02-08 05:38:20,788 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -71 predicate places. [2025-02-08 05:38:20,788 INFO L471 AbstractCegarLoop]: Abstraction has has 905 places, 911 transitions, 1835 flow [2025-02-08 05:38:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.3333333333334) internal successors, (2968), 3 states have internal predecessors, (2968), 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:38:20,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:20,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:20,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:20,791 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:20,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1622890171, now seen corresponding path program 1 times [2025-02-08 05:38:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699244052] [2025-02-08 05:38:20,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-08 05:38:20,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-08 05:38:20,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:20,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:20,874 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:38:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699244052] [2025-02-08 05:38:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699244052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:20,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253658142] [2025-02-08 05:38:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:20,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:20,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:20,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:20,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 984 out of 1027 [2025-02-08 05:38:20,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 911 transitions, 1835 flow. Second operand has 3 states, 3 states have (on average 985.3333333333334) internal successors, (2956), 3 states have internal predecessors, (2956), 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:38:20,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:20,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 984 of 1027 [2025-02-08 05:38:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:21,322 INFO L124 PetriNetUnfolderBase]: 63/2173 cut-off events. [2025-02-08 05:38:21,322 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:38:21,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 2173 events. 63/2173 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 12149 event pairs, 26 based on Foata normal form. 0/1893 useless extension candidates. Maximal degree in co-relation 2229. Up to 75 conditions per place. [2025-02-08 05:38:21,356 INFO L140 encePairwiseOnDemand]: 1021/1027 looper letters, 17 selfloop transitions, 2 changer transitions 0/911 dead transitions. [2025-02-08 05:38:21,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 911 transitions, 1875 flow [2025-02-08 05:38:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2975 transitions. [2025-02-08 05:38:21,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655955858487504 [2025-02-08 05:38:21,359 INFO L175 Difference]: Start difference. First operand has 905 places, 911 transitions, 1835 flow. Second operand 3 states and 2975 transitions. [2025-02-08 05:38:21,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 911 transitions, 1875 flow [2025-02-08 05:38:21,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 911 transitions, 1871 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:21,380 INFO L231 Difference]: Finished difference. Result has 902 places, 909 transitions, 1837 flow [2025-02-08 05:38:21,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1837, PETRI_PLACES=902, PETRI_TRANSITIONS=909} [2025-02-08 05:38:21,382 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -74 predicate places. [2025-02-08 05:38:21,382 INFO L471 AbstractCegarLoop]: Abstraction has has 902 places, 909 transitions, 1837 flow [2025-02-08 05:38:21,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 985.3333333333334) internal successors, (2956), 3 states have internal predecessors, (2956), 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:38:21,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:21,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:21,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:38:21,383 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:21,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1688103691, now seen corresponding path program 1 times [2025-02-08 05:38:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847263060] [2025-02-08 05:38:21,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:21,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-08 05:38:21,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-08 05:38:21,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:21,543 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:38:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847263060] [2025-02-08 05:38:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847263060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711041984] [2025-02-08 05:38:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:21,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:21,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:21,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:21,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 984 out of 1027 [2025-02-08 05:38:21,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 909 transitions, 1837 flow. Second operand has 3 states, 3 states have (on average 985.6666666666666) internal successors, (2957), 3 states have internal predecessors, (2957), 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:38:21,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:21,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 984 of 1027 [2025-02-08 05:38:21,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:22,013 INFO L124 PetriNetUnfolderBase]: 115/3465 cut-off events. [2025-02-08 05:38:22,013 INFO L125 PetriNetUnfolderBase]: For 6/14 co-relation queries the response was YES. [2025-02-08 05:38:22,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 3465 events. 115/3465 cut-off events. For 6/14 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 25742 event pairs, 49 based on Foata normal form. 0/2998 useless extension candidates. Maximal degree in co-relation 3601. Up to 123 conditions per place. [2025-02-08 05:38:22,052 INFO L140 encePairwiseOnDemand]: 1021/1027 looper letters, 17 selfloop transitions, 2 changer transitions 0/909 dead transitions. [2025-02-08 05:38:22,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 909 transitions, 1877 flow [2025-02-08 05:38:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2975 transitions. [2025-02-08 05:38:22,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655955858487504 [2025-02-08 05:38:22,054 INFO L175 Difference]: Start difference. First operand has 902 places, 909 transitions, 1837 flow. Second operand 3 states and 2975 transitions. [2025-02-08 05:38:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 909 transitions, 1877 flow [2025-02-08 05:38:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 909 transitions, 1877 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:22,063 INFO L231 Difference]: Finished difference. Result has 901 places, 907 transitions, 1843 flow [2025-02-08 05:38:22,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1843, PETRI_PLACES=901, PETRI_TRANSITIONS=907} [2025-02-08 05:38:22,064 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -75 predicate places. [2025-02-08 05:38:22,064 INFO L471 AbstractCegarLoop]: Abstraction has has 901 places, 907 transitions, 1843 flow [2025-02-08 05:38:22,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 985.6666666666666) internal successors, (2957), 3 states have internal predecessors, (2957), 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:38:22,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:22,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:22,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:38:22,066 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:22,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1567582239, now seen corresponding path program 1 times [2025-02-08 05:38:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:22,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220561147] [2025-02-08 05:38:22,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:22,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-08 05:38:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-08 05:38:22,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:22,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:22,338 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:38:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220561147] [2025-02-08 05:38:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220561147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:22,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:22,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:38:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85668640] [2025-02-08 05:38:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:38:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:22,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:38:22,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:38:22,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 961 out of 1027 [2025-02-08 05:38:22,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 907 transitions, 1843 flow. Second operand has 7 states, 7 states have (on average 965.4285714285714) internal successors, (6758), 7 states have internal predecessors, (6758), 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:38:22,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:22,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 961 of 1027 [2025-02-08 05:38:22,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:23,131 INFO L124 PetriNetUnfolderBase]: 40/2177 cut-off events. [2025-02-08 05:38:23,131 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-02-08 05:38:23,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 2177 events. 40/2177 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10978 event pairs, 0 based on Foata normal form. 1/1955 useless extension candidates. Maximal degree in co-relation 2246. Up to 40 conditions per place. [2025-02-08 05:38:23,166 INFO L140 encePairwiseOnDemand]: 1017/1027 looper letters, 67 selfloop transitions, 9 changer transitions 0/942 dead transitions. [2025-02-08 05:38:23,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 942 transitions, 2071 flow [2025-02-08 05:38:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:38:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:38:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6804 transitions. [2025-02-08 05:38:23,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464459591041869 [2025-02-08 05:38:23,172 INFO L175 Difference]: Start difference. First operand has 901 places, 907 transitions, 1843 flow. Second operand 7 states and 6804 transitions. [2025-02-08 05:38:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 942 transitions, 2071 flow [2025-02-08 05:38:23,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 942 transitions, 2071 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:23,183 INFO L231 Difference]: Finished difference. Result has 911 places, 913 transitions, 1900 flow [2025-02-08 05:38:23,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1900, PETRI_PLACES=911, PETRI_TRANSITIONS=913} [2025-02-08 05:38:23,184 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -65 predicate places. [2025-02-08 05:38:23,184 INFO L471 AbstractCegarLoop]: Abstraction has has 911 places, 913 transitions, 1900 flow [2025-02-08 05:38:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 965.4285714285714) internal successors, (6758), 7 states have internal predecessors, (6758), 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:38:23,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:38:23,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1140834494, now seen corresponding path program 1 times [2025-02-08 05:38:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629956868] [2025-02-08 05:38:23,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-08 05:38:23,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-08 05:38:23,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,479 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:38:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629956868] [2025-02-08 05:38:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629956868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:38:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701587502] [2025-02-08 05:38:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:38:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:38:23,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:38:24,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 956 out of 1027 [2025-02-08 05:38:24,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 913 transitions, 1900 flow. Second operand has 8 states, 8 states have (on average 960.375) internal successors, (7683), 8 states have internal predecessors, (7683), 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:38:24,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:24,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 956 of 1027 [2025-02-08 05:38:24,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:24,878 INFO L124 PetriNetUnfolderBase]: 58/3188 cut-off events. [2025-02-08 05:38:24,878 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2025-02-08 05:38:24,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 3188 events. 58/3188 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 20041 event pairs, 0 based on Foata normal form. 1/2857 useless extension candidates. Maximal degree in co-relation 3351. Up to 82 conditions per place. [2025-02-08 05:38:24,930 INFO L140 encePairwiseOnDemand]: 1014/1027 looper letters, 80 selfloop transitions, 13 changer transitions 0/954 dead transitions. [2025-02-08 05:38:24,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 954 transitions, 2188 flow [2025-02-08 05:38:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:38:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:38:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8692 transitions. [2025-02-08 05:38:24,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9403873201341556 [2025-02-08 05:38:24,936 INFO L175 Difference]: Start difference. First operand has 911 places, 913 transitions, 1900 flow. Second operand 9 states and 8692 transitions. [2025-02-08 05:38:24,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 954 transitions, 2188 flow [2025-02-08 05:38:24,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 954 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:24,948 INFO L231 Difference]: Finished difference. Result has 924 places, 924 transitions, 1989 flow [2025-02-08 05:38:24,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1989, PETRI_PLACES=924, PETRI_TRANSITIONS=924} [2025-02-08 05:38:24,950 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -52 predicate places. [2025-02-08 05:38:24,950 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 924 transitions, 1989 flow [2025-02-08 05:38:24,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 960.375) internal successors, (7683), 8 states have internal predecessors, (7683), 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:38:24,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:24,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:38:24,951 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1813282302, now seen corresponding path program 1 times [2025-02-08 05:38:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148806167] [2025-02-08 05:38:24,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:24,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 05:38:24,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 05:38:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148806167] [2025-02-08 05:38:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148806167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190764010] [2025-02-08 05:38:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:25,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:25,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:26,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 954 out of 1027 [2025-02-08 05:38:26,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 924 transitions, 1989 flow. Second operand has 6 states, 6 states have (on average 955.6666666666666) internal successors, (5734), 6 states have internal predecessors, (5734), 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:38:26,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:26,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 954 of 1027 [2025-02-08 05:38:26,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:28,542 INFO L124 PetriNetUnfolderBase]: 793/12077 cut-off events. [2025-02-08 05:38:28,542 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 05:38:28,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13759 conditions, 12077 events. 793/12077 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 133851 event pairs, 294 based on Foata normal form. 0/10508 useless extension candidates. Maximal degree in co-relation 13702. Up to 1230 conditions per place. [2025-02-08 05:38:28,779 INFO L140 encePairwiseOnDemand]: 1015/1027 looper letters, 65 selfloop transitions, 8 changer transitions 0/948 dead transitions. [2025-02-08 05:38:28,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 948 transitions, 2191 flow [2025-02-08 05:38:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5801 transitions. [2025-02-08 05:38:28,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414151249594288 [2025-02-08 05:38:28,782 INFO L175 Difference]: Start difference. First operand has 924 places, 924 transitions, 1989 flow. Second operand 6 states and 5801 transitions. [2025-02-08 05:38:28,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 948 transitions, 2191 flow [2025-02-08 05:38:28,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 948 transitions, 2191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:28,792 INFO L231 Difference]: Finished difference. Result has 929 places, 928 transitions, 2043 flow [2025-02-08 05:38:28,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2043, PETRI_PLACES=929, PETRI_TRANSITIONS=928} [2025-02-08 05:38:28,793 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -47 predicate places. [2025-02-08 05:38:28,793 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 928 transitions, 2043 flow [2025-02-08 05:38:28,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 955.6666666666666) internal successors, (5734), 6 states have internal predecessors, (5734), 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:38:28,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:28,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:38:28,794 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 894190464, now seen corresponding path program 1 times [2025-02-08 05:38:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760406341] [2025-02-08 05:38:28,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:28,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-08 05:38:28,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-08 05:38:28,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:28,853 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:38:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760406341] [2025-02-08 05:38:28,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760406341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:28,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:28,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:28,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338204872] [2025-02-08 05:38:28,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:28,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:28,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:28,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:28,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 989 out of 1027 [2025-02-08 05:38:28,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 928 transitions, 2043 flow. Second operand has 3 states, 3 states have (on average 990.6666666666666) internal successors, (2972), 3 states have internal predecessors, (2972), 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:38:28,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:28,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 989 of 1027 [2025-02-08 05:38:28,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:30,434 INFO L124 PetriNetUnfolderBase]: 169/6680 cut-off events. [2025-02-08 05:38:30,434 INFO L125 PetriNetUnfolderBase]: For 39/84 co-relation queries the response was YES. [2025-02-08 05:38:30,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 6680 events. 169/6680 cut-off events. For 39/84 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 64049 event pairs, 30 based on Foata normal form. 3/5846 useless extension candidates. Maximal degree in co-relation 7107. Up to 101 conditions per place. [2025-02-08 05:38:30,570 INFO L140 encePairwiseOnDemand]: 1024/1027 looper letters, 13 selfloop transitions, 2 changer transitions 0/929 dead transitions. [2025-02-08 05:38:30,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 929 transitions, 2077 flow [2025-02-08 05:38:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2983 transitions. [2025-02-08 05:38:30,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681921454073353 [2025-02-08 05:38:30,573 INFO L175 Difference]: Start difference. First operand has 929 places, 928 transitions, 2043 flow. Second operand 3 states and 2983 transitions. [2025-02-08 05:38:30,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 929 transitions, 2077 flow [2025-02-08 05:38:30,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 929 transitions, 2077 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:30,588 INFO L231 Difference]: Finished difference. Result has 930 places, 927 transitions, 2045 flow [2025-02-08 05:38:30,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1027, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2045, PETRI_PLACES=930, PETRI_TRANSITIONS=927} [2025-02-08 05:38:30,590 INFO L279 CegarLoopForPetriNet]: 976 programPoint places, -46 predicate places. [2025-02-08 05:38:30,590 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 927 transitions, 2045 flow [2025-02-08 05:38:30,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 990.6666666666666) internal successors, (2972), 3 states have internal predecessors, (2972), 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:38:30,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:30,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:38:30,591 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-02-08 05:38:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash -621762290, now seen corresponding path program 1 times [2025-02-08 05:38:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329521030] [2025-02-08 05:38:30,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:30,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-08 05:38:30,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-08 05:38:30,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat