./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-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-simpl-str-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 f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:10,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:10,919 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:38:10,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:10,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:10,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:10,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:10,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:10,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:10,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:10,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:10,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:10,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:10,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:10,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:10,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:10,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:10,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:10,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:10,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:10,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:10,962 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 -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2025-02-08 05:38:11,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:11,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:11,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:11,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:11,222 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:11,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-02-08 05:38:12,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2b99c69/abb5529b044d4046b744ca26d00f77d3/FLAGa8f0a1370 [2025-02-08 05:38:12,739 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:12,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-02-08 05:38:12,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2b99c69/abb5529b044d4046b744ca26d00f77d3/FLAGa8f0a1370 [2025-02-08 05:38:13,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b2b99c69/abb5529b044d4046b744ca26d00f77d3 [2025-02-08 05:38:13,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:13,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:13,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:13,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:13,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:13,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c774eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13, skipping insertion in model container [2025-02-08 05:38:13,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:13,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:13,237 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:13,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:13,267 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:13,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13 WrapperNode [2025-02-08 05:38:13,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:13,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:13,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:13,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:13,272 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:38:13" (1/1) ... [2025-02-08 05:38:13,277 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:38:13" (1/1) ... [2025-02-08 05:38:13,296 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-02-08 05:38:13,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:13,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:13,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:13,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:13,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:13,330 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:13,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:13,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:13,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (1/1) ... [2025-02-08 05:38:13,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:13,357 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:38:13,359 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:38:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:13,380 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:38:13,468 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:13,471 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:13,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-11: #t~ite2#1 := #t~ret1#1; [2025-02-08 05:38:13,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:38:13,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:13,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:13,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-15: #t~ret1#1 := minus_#res#1; [2025-02-08 05:38:13,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-11: #t~ite6#1 := #t~ret5#1; [2025-02-08 05:38:13,687 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 05:38:13,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:13,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:13,688 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-15: #t~ret5#1 := minus_#res#1; [2025-02-08 05:38:13,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-11: #t~ite10#1 := #t~ret9#1; [2025-02-08 05:38:13,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:38:13,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:13,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:13,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-15: #t~ret9#1 := minus_#res#1; [2025-02-08 05:38:13,841 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:13,841 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:13,860 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:13,860 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:13,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:13 BoogieIcfgContainer [2025-02-08 05:38:13,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:13,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:13,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:13,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:13,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:13" (1/3) ... [2025-02-08 05:38:13,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3bd818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:13, skipping insertion in model container [2025-02-08 05:38:13,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:13" (2/3) ... [2025-02-08 05:38:13,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3bd818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:13, skipping insertion in model container [2025-02-08 05:38:13,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:13" (3/3) ... [2025-02-08 05:38:13,871 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-02-08 05:38:13,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:13,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 290 locations, 1 initial locations, 0 loop locations, and 27 error locations. [2025-02-08 05:38:13,888 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:14,005 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:14,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 301 transitions, 623 flow [2025-02-08 05:38:14,150 INFO L124 PetriNetUnfolderBase]: 12/298 cut-off events. [2025-02-08 05:38:14,155 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 298 events. 12/298 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 730 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 205. Up to 2 conditions per place. [2025-02-08 05:38:14,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 301 transitions, 623 flow [2025-02-08 05:38:14,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 277 transitions, 572 flow [2025-02-08 05:38:14,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:14,196 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;@34f4d313, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:14,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-02-08 05:38:14,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:14,206 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:38:14,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:14,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:14,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:14,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash 699244152, now seen corresponding path program 1 times [2025-02-08 05:38:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526833932] [2025-02-08 05:38:14,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:38:14,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:38:14,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,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:38:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526833932] [2025-02-08 05:38:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526833932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035157896] [2025-02-08 05:38:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 301 [2025-02-08 05:38:14,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:14,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 301 [2025-02-08 05:38:14,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:14,595 INFO L124 PetriNetUnfolderBase]: 12/436 cut-off events. [2025-02-08 05:38:14,596 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:38:14,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 436 events. 12/436 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1914 event pairs, 5 based on Foata normal form. 18/384 useless extension candidates. Maximal degree in co-relation 356. Up to 22 conditions per place. [2025-02-08 05:38:14,605 INFO L140 encePairwiseOnDemand]: 292/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-02-08 05:38:14,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 584 flow [2025-02-08 05:38:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-02-08 05:38:14,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9457364341085271 [2025-02-08 05:38:14,627 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 572 flow. Second operand 3 states and 854 transitions. [2025-02-08 05:38:14,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 584 flow [2025-02-08 05:38:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 270 transitions, 572 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:14,640 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 550 flow [2025-02-08 05:38:14,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2025-02-08 05:38:14,645 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -5 predicate places. [2025-02-08 05:38:14,645 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 550 flow [2025-02-08 05:38:14,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:14,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:14,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:14,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1957353974, now seen corresponding path program 1 times [2025-02-08 05:38:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233539078] [2025-02-08 05:38:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:38:14,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:38:14,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,730 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:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233539078] [2025-02-08 05:38:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233539078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225954169] [2025-02-08 05:38:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 301 [2025-02-08 05:38:14,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:14,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 301 [2025-02-08 05:38:14,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:14,832 INFO L124 PetriNetUnfolderBase]: 11/393 cut-off events. [2025-02-08 05:38:14,833 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:14,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 393 events. 11/393 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1584 event pairs, 5 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 392. Up to 22 conditions per place. [2025-02-08 05:38:14,839 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:38:14,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 574 flow [2025-02-08 05:38:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-02-08 05:38:14,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390919158361019 [2025-02-08 05:38:14,841 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 550 flow. Second operand 3 states and 848 transitions. [2025-02-08 05:38:14,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 574 flow [2025-02-08 05:38:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 269 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:14,851 INFO L231 Difference]: Finished difference. Result has 271 places, 269 transitions, 548 flow [2025-02-08 05:38:14,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=271, PETRI_TRANSITIONS=269} [2025-02-08 05:38:14,852 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -6 predicate places. [2025-02-08 05:38:14,852 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 269 transitions, 548 flow [2025-02-08 05:38:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:14,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:14,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:14,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2099374550, now seen corresponding path program 1 times [2025-02-08 05:38:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-02-08 05:38:14,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:38:14,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:38:14,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,915 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:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089818807] [2025-02-08 05:38:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089818807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129225571] [2025-02-08 05:38:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 301 [2025-02-08 05:38:14,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 269 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:14,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 301 [2025-02-08 05:38:14,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,077 INFO L124 PetriNetUnfolderBase]: 23/636 cut-off events. [2025-02-08 05:38:15,077 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:15,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 636 events. 23/636 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3437 event pairs, 12 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 645. Up to 35 conditions per place. [2025-02-08 05:38:15,084 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 12 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:38:15,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 574 flow [2025-02-08 05:38:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-02-08 05:38:15,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9368770764119602 [2025-02-08 05:38:15,088 INFO L175 Difference]: Start difference. First operand has 271 places, 269 transitions, 548 flow. Second operand 3 states and 846 transitions. [2025-02-08 05:38:15,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 574 flow [2025-02-08 05:38:15,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 268 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,093 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 546 flow [2025-02-08 05:38:15,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2025-02-08 05:38:15,094 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -7 predicate places. [2025-02-08 05:38:15,094 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 546 flow [2025-02-08 05:38:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:15,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:15,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:15,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2127377138, now seen corresponding path program 1 times [2025-02-08 05:38:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227005871] [2025-02-08 05:38:15,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:38:15,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:38:15,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,160 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:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227005871] [2025-02-08 05:38:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227005871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187565341] [2025-02-08 05:38:15,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 301 [2025-02-08 05:38:15,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:15,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 301 [2025-02-08 05:38:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,276 INFO L124 PetriNetUnfolderBase]: 15/506 cut-off events. [2025-02-08 05:38:15,276 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:38:15,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 506 events. 15/506 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2353 event pairs, 7 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 494. Up to 25 conditions per place. [2025-02-08 05:38:15,283 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:38:15,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 267 transitions, 570 flow [2025-02-08 05:38:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-02-08 05:38:15,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390919158361019 [2025-02-08 05:38:15,286 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 546 flow. Second operand 3 states and 848 transitions. [2025-02-08 05:38:15,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 267 transitions, 570 flow [2025-02-08 05:38:15,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 267 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,291 INFO L231 Difference]: Finished difference. Result has 269 places, 267 transitions, 544 flow [2025-02-08 05:38:15,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=269, PETRI_TRANSITIONS=267} [2025-02-08 05:38:15,292 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -8 predicate places. [2025-02-08 05:38:15,292 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 267 transitions, 544 flow [2025-02-08 05:38:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:15,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:15,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:15,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1346726215, now seen corresponding path program 1 times [2025-02-08 05:38:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374011371] [2025-02-08 05:38:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:38:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:38:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,369 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:15,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374011371] [2025-02-08 05:38:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374011371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941746572] [2025-02-08 05:38:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 301 [2025-02-08 05:38:15,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 267 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:15,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 301 [2025-02-08 05:38:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,534 INFO L124 PetriNetUnfolderBase]: 32/670 cut-off events. [2025-02-08 05:38:15,534 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-08 05:38:15,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 670 events. 32/670 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3417 event pairs, 20 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 673. Up to 50 conditions per place. [2025-02-08 05:38:15,542 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 13 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:38:15,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 266 transitions, 572 flow [2025-02-08 05:38:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2025-02-08 05:38:15,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346622369878184 [2025-02-08 05:38:15,547 INFO L175 Difference]: Start difference. First operand has 269 places, 267 transitions, 544 flow. Second operand 3 states and 844 transitions. [2025-02-08 05:38:15,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 266 transitions, 572 flow [2025-02-08 05:38:15,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,553 INFO L231 Difference]: Finished difference. Result has 268 places, 266 transitions, 542 flow [2025-02-08 05:38:15,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=268, PETRI_TRANSITIONS=266} [2025-02-08 05:38:15,555 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -9 predicate places. [2025-02-08 05:38:15,555 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 266 transitions, 542 flow [2025-02-08 05:38:15,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:15,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:15,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -464411505, now seen corresponding path program 1 times [2025-02-08 05:38:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073274330] [2025-02-08 05:38:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:38:15,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:38:15,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,626 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:15,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073274330] [2025-02-08 05:38:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073274330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198400197] [2025-02-08 05:38:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 301 [2025-02-08 05:38:15,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:15,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 301 [2025-02-08 05:38:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,716 INFO L124 PetriNetUnfolderBase]: 12/333 cut-off events. [2025-02-08 05:38:15,716 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-08 05:38:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 333 events. 12/333 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1163 event pairs, 7 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 302. Up to 25 conditions per place. [2025-02-08 05:38:15,721 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-08 05:38:15,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 265 transitions, 566 flow [2025-02-08 05:38:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-02-08 05:38:15,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390919158361019 [2025-02-08 05:38:15,723 INFO L175 Difference]: Start difference. First operand has 268 places, 266 transitions, 542 flow. Second operand 3 states and 848 transitions. [2025-02-08 05:38:15,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 265 transitions, 566 flow [2025-02-08 05:38:15,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 265 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,728 INFO L231 Difference]: Finished difference. Result has 267 places, 265 transitions, 540 flow [2025-02-08 05:38:15,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=267, PETRI_TRANSITIONS=265} [2025-02-08 05:38:15,730 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -10 predicate places. [2025-02-08 05:38:15,730 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 265 transitions, 540 flow [2025-02-08 05:38:15,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:15,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:15,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:15,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash 79951892, now seen corresponding path program 1 times [2025-02-08 05:38:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022370043] [2025-02-08 05:38:15,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:38:15,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:38:15,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:15,800 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:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022370043] [2025-02-08 05:38:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022370043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950130503] [2025-02-08 05:38:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:15,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:15,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:15,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 301 [2025-02-08 05:38:15,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:15,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:15,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 301 [2025-02-08 05:38:15,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:15,918 INFO L124 PetriNetUnfolderBase]: 23/649 cut-off events. [2025-02-08 05:38:15,918 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:15,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 649 events. 23/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3674 event pairs, 8 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 622. Up to 31 conditions per place. [2025-02-08 05:38:15,925 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 13 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:38:15,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 267 transitions, 576 flow [2025-02-08 05:38:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-08 05:38:15,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490586932447398 [2025-02-08 05:38:15,927 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 540 flow. Second operand 3 states and 857 transitions. [2025-02-08 05:38:15,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 267 transitions, 576 flow [2025-02-08 05:38:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 267 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:15,932 INFO L231 Difference]: Finished difference. Result has 266 places, 265 transitions, 546 flow [2025-02-08 05:38:15,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=266, PETRI_TRANSITIONS=265} [2025-02-08 05:38:15,934 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:15,934 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 265 transitions, 546 flow [2025-02-08 05:38:15,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:15,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:15,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:15,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:15,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:15,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1859450758, now seen corresponding path program 1 times [2025-02-08 05:38:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190134313] [2025-02-08 05:38:15,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:15,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:38:15,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:38:15,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:15,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,006 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:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190134313] [2025-02-08 05:38:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190134313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660466289] [2025-02-08 05:38:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 301 [2025-02-08 05:38:16,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 265 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:16,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 301 [2025-02-08 05:38:16,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:16,170 INFO L124 PetriNetUnfolderBase]: 59/1179 cut-off events. [2025-02-08 05:38:16,171 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:16,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 1179 events. 59/1179 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9326 event pairs, 21 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1098. Up to 73 conditions per place. [2025-02-08 05:38:16,183 INFO L140 encePairwiseOnDemand]: 295/301 looper letters, 15 selfloop transitions, 3 changer transitions 0/267 dead transitions. [2025-02-08 05:38:16,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 267 transitions, 588 flow [2025-02-08 05:38:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2025-02-08 05:38:16,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435215946843853 [2025-02-08 05:38:16,186 INFO L175 Difference]: Start difference. First operand has 266 places, 265 transitions, 546 flow. Second operand 3 states and 852 transitions. [2025-02-08 05:38:16,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 267 transitions, 588 flow [2025-02-08 05:38:16,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 267 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:16,192 INFO L231 Difference]: Finished difference. Result has 266 places, 265 transitions, 561 flow [2025-02-08 05:38:16,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=266, PETRI_TRANSITIONS=265} [2025-02-08 05:38:16,193 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:16,193 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 265 transitions, 561 flow [2025-02-08 05:38:16,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:16,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:16,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:16,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:16,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1620858397, now seen corresponding path program 1 times [2025-02-08 05:38:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698723397] [2025-02-08 05:38:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:38:16,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:38:16,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,248 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:16,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698723397] [2025-02-08 05:38:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698723397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079017256] [2025-02-08 05:38:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 301 [2025-02-08 05:38:16,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 265 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:16,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 301 [2025-02-08 05:38:16,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:16,363 INFO L124 PetriNetUnfolderBase]: 22/601 cut-off events. [2025-02-08 05:38:16,363 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 05:38:16,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 601 events. 22/601 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3172 event pairs, 2 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 525. Up to 30 conditions per place. [2025-02-08 05:38:16,370 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 15 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-08 05:38:16,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 269 transitions, 607 flow [2025-02-08 05:38:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-02-08 05:38:16,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512735326688815 [2025-02-08 05:38:16,373 INFO L175 Difference]: Start difference. First operand has 266 places, 265 transitions, 561 flow. Second operand 3 states and 859 transitions. [2025-02-08 05:38:16,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 269 transitions, 607 flow [2025-02-08 05:38:16,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 269 transitions, 607 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:16,381 INFO L231 Difference]: Finished difference. Result has 267 places, 265 transitions, 571 flow [2025-02-08 05:38:16,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=267, PETRI_TRANSITIONS=265} [2025-02-08 05:38:16,383 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -10 predicate places. [2025-02-08 05:38:16,383 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 265 transitions, 571 flow [2025-02-08 05:38:16,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:16,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:16,384 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:38:16,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:16,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1428189504, now seen corresponding path program 1 times [2025-02-08 05:38:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863277801] [2025-02-08 05:38:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:38:16,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:38:16,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,444 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:16,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863277801] [2025-02-08 05:38:16,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863277801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906908287] [2025-02-08 05:38:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 301 [2025-02-08 05:38:16,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 265 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:16,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 301 [2025-02-08 05:38:16,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:16,581 INFO L124 PetriNetUnfolderBase]: 35/726 cut-off events. [2025-02-08 05:38:16,581 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:38:16,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 726 events. 35/726 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4471 event pairs, 4 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 690. Up to 52 conditions per place. [2025-02-08 05:38:16,591 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 14 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-08 05:38:16,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 268 transitions, 612 flow [2025-02-08 05:38:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-02-08 05:38:16,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501661129568106 [2025-02-08 05:38:16,594 INFO L175 Difference]: Start difference. First operand has 267 places, 265 transitions, 571 flow. Second operand 3 states and 858 transitions. [2025-02-08 05:38:16,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 268 transitions, 612 flow [2025-02-08 05:38:16,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:16,599 INFO L231 Difference]: Finished difference. Result has 268 places, 265 transitions, 581 flow [2025-02-08 05:38:16,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=268, PETRI_TRANSITIONS=265} [2025-02-08 05:38:16,602 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -9 predicate places. [2025-02-08 05:38:16,602 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 265 transitions, 581 flow [2025-02-08 05:38:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:16,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:16,603 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:38:16,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:16,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 177296895, now seen corresponding path program 1 times [2025-02-08 05:38:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732572902] [2025-02-08 05:38:16,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:38:16,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:38:16,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,673 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:16,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732572902] [2025-02-08 05:38:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732572902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352768709] [2025-02-08 05:38:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 301 [2025-02-08 05:38:16,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 265 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:16,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 301 [2025-02-08 05:38:16,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:16,796 INFO L124 PetriNetUnfolderBase]: 22/600 cut-off events. [2025-02-08 05:38:16,796 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:16,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 600 events. 22/600 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3393 event pairs, 4 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 543. Up to 18 conditions per place. [2025-02-08 05:38:16,806 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-02-08 05:38:16,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 266 transitions, 611 flow [2025-02-08 05:38:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-08 05:38:16,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490586932447398 [2025-02-08 05:38:16,809 INFO L175 Difference]: Start difference. First operand has 268 places, 265 transitions, 581 flow. Second operand 3 states and 857 transitions. [2025-02-08 05:38:16,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 266 transitions, 611 flow [2025-02-08 05:38:16,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 611 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:16,816 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 583 flow [2025-02-08 05:38:16,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-02-08 05:38:16,817 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -8 predicate places. [2025-02-08 05:38:16,817 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 583 flow [2025-02-08 05:38:16,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:16,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:16,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:16,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:16,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1688968512, now seen corresponding path program 1 times [2025-02-08 05:38:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479537963] [2025-02-08 05:38:16,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:16,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:16,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:38:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:38:16,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:16,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:16,871 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:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479537963] [2025-02-08 05:38:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479537963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773686751] [2025-02-08 05:38:16,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:16,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:16,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:16,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:16,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 301 [2025-02-08 05:38:16,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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:16,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:16,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 301 [2025-02-08 05:38:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,213 INFO L124 PetriNetUnfolderBase]: 173/2253 cut-off events. [2025-02-08 05:38:17,214 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2025-02-08 05:38:17,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 2253 events. 173/2253 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 21706 event pairs, 44 based on Foata normal form. 1/1988 useless extension candidates. Maximal degree in co-relation 2177. Up to 246 conditions per place. [2025-02-08 05:38:17,233 INFO L140 encePairwiseOnDemand]: 293/301 looper letters, 17 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2025-02-08 05:38:17,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 631 flow [2025-02-08 05:38:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-02-08 05:38:17,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-02-08 05:38:17,236 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 583 flow. Second operand 3 states and 847 transitions. [2025-02-08 05:38:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 631 flow [2025-02-08 05:38:17,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:17,242 INFO L231 Difference]: Finished difference. Result has 266 places, 264 transitions, 599 flow [2025-02-08 05:38:17,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=266, PETRI_TRANSITIONS=264} [2025-02-08 05:38:17,244 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:17,244 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 264 transitions, 599 flow [2025-02-08 05:38:17,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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:17,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:17,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:17,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1232690836, now seen corresponding path program 1 times [2025-02-08 05:38:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100382401] [2025-02-08 05:38:17,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:38:17,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:38:17,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,293 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:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100382401] [2025-02-08 05:38:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100382401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331995521] [2025-02-08 05:38:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:17,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 301 [2025-02-08 05:38:17,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 264 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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:17,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 301 [2025-02-08 05:38:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,461 INFO L124 PetriNetUnfolderBase]: 88/1560 cut-off events. [2025-02-08 05:38:17,462 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-02-08 05:38:17,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 1560 events. 88/1560 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 12956 event pairs, 14 based on Foata normal form. 0/1392 useless extension candidates. Maximal degree in co-relation 1491. Up to 130 conditions per place. [2025-02-08 05:38:17,475 INFO L140 encePairwiseOnDemand]: 297/301 looper letters, 13 selfloop transitions, 2 changer transitions 1/267 dead transitions. [2025-02-08 05:38:17,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 267 transitions, 640 flow [2025-02-08 05:38:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-02-08 05:38:17,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501661129568106 [2025-02-08 05:38:17,478 INFO L175 Difference]: Start difference. First operand has 266 places, 264 transitions, 599 flow. Second operand 3 states and 858 transitions. [2025-02-08 05:38:17,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 267 transitions, 640 flow [2025-02-08 05:38:17,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:17,482 INFO L231 Difference]: Finished difference. Result has 267 places, 264 transitions, 609 flow [2025-02-08 05:38:17,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=267, PETRI_TRANSITIONS=264} [2025-02-08 05:38:17,483 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -10 predicate places. [2025-02-08 05:38:17,483 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 264 transitions, 609 flow [2025-02-08 05:38:17,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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:17,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:17,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1456790061, now seen corresponding path program 1 times [2025-02-08 05:38:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670496797] [2025-02-08 05:38:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:38:17,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:38:17,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,534 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:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670496797] [2025-02-08 05:38:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670496797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802720278] [2025-02-08 05:38:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:17,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 301 [2025-02-08 05:38:17,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 264 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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:17,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:17,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 301 [2025-02-08 05:38:17,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,683 INFO L124 PetriNetUnfolderBase]: 66/1278 cut-off events. [2025-02-08 05:38:17,683 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:38:17,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1278 events. 66/1278 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10266 event pairs, 8 based on Foata normal form. 0/1149 useless extension candidates. Maximal degree in co-relation 1243. Up to 50 conditions per place. [2025-02-08 05:38:17,697 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-08 05:38:17,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 265 transitions, 639 flow [2025-02-08 05:38:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-08 05:38:17,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490586932447398 [2025-02-08 05:38:17,699 INFO L175 Difference]: Start difference. First operand has 267 places, 264 transitions, 609 flow. Second operand 3 states and 857 transitions. [2025-02-08 05:38:17,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 265 transitions, 639 flow [2025-02-08 05:38:17,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 265 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:17,704 INFO L231 Difference]: Finished difference. Result has 268 places, 263 transitions, 611 flow [2025-02-08 05:38:17,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=268, PETRI_TRANSITIONS=263} [2025-02-08 05:38:17,706 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -9 predicate places. [2025-02-08 05:38:17,706 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 263 transitions, 611 flow [2025-02-08 05:38:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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:17,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:17,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:17,707 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:17,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash -311986857, now seen corresponding path program 1 times [2025-02-08 05:38:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125029317] [2025-02-08 05:38:17,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:38:17,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:38:17,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,753 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:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125029317] [2025-02-08 05:38:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125029317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649588689] [2025-02-08 05:38:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:17,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 301 [2025-02-08 05:38:17,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 263 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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:17,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:17,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 301 [2025-02-08 05:38:17,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,890 INFO L124 PetriNetUnfolderBase]: 60/1041 cut-off events. [2025-02-08 05:38:17,890 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-02-08 05:38:17,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1041 events. 60/1041 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7705 event pairs, 8 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1211. Up to 44 conditions per place. [2025-02-08 05:38:17,902 INFO L140 encePairwiseOnDemand]: 298/301 looper letters, 11 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-02-08 05:38:17,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 264 transitions, 641 flow [2025-02-08 05:38:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-08 05:38:17,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490586932447398 [2025-02-08 05:38:17,905 INFO L175 Difference]: Start difference. First operand has 268 places, 263 transitions, 611 flow. Second operand 3 states and 857 transitions. [2025-02-08 05:38:17,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 264 transitions, 641 flow [2025-02-08 05:38:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 264 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:17,910 INFO L231 Difference]: Finished difference. Result has 267 places, 262 transitions, 609 flow [2025-02-08 05:38:17,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=267, PETRI_TRANSITIONS=262} [2025-02-08 05:38:17,912 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -10 predicate places. [2025-02-08 05:38:17,912 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 262 transitions, 609 flow [2025-02-08 05:38:17,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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:17,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:17,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:17,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:17,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:17,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 326122311, now seen corresponding path program 1 times [2025-02-08 05:38:17,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:17,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251792288] [2025-02-08 05:38:17,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:17,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:38:17,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:38:17,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:17,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:17,968 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:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:17,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251792288] [2025-02-08 05:38:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251792288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348388001] [2025-02-08 05:38:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:17,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:17,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:17,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 301 [2025-02-08 05:38:17,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 262 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:17,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:17,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 301 [2025-02-08 05:38:17,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:18,101 INFO L124 PetriNetUnfolderBase]: 55/1208 cut-off events. [2025-02-08 05:38:18,102 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:18,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1208 events. 55/1208 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9281 event pairs, 2 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 1293. Up to 54 conditions per place. [2025-02-08 05:38:18,115 INFO L140 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2025-02-08 05:38:18,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 261 transitions, 625 flow [2025-02-08 05:38:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-02-08 05:38:18,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512735326688815 [2025-02-08 05:38:18,118 INFO L175 Difference]: Start difference. First operand has 267 places, 262 transitions, 609 flow. Second operand 3 states and 859 transitions. [2025-02-08 05:38:18,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 261 transitions, 625 flow [2025-02-08 05:38:18,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 261 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:18,124 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 605 flow [2025-02-08 05:38:18,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2025-02-08 05:38:18,125 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:18,125 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 605 flow [2025-02-08 05:38:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:18,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:18,126 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] [2025-02-08 05:38:18,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:18,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:18,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1499650819, now seen corresponding path program 1 times [2025-02-08 05:38:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:18,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532168661] [2025-02-08 05:38:18,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:18,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:38:18,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:38:18,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:18,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:18,188 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:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532168661] [2025-02-08 05:38:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532168661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438798794] [2025-02-08 05:38:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:18,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:18,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:18,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 301 [2025-02-08 05:38:18,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:18,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:18,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 301 [2025-02-08 05:38:18,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:18,325 INFO L124 PetriNetUnfolderBase]: 53/1222 cut-off events. [2025-02-08 05:38:18,325 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:18,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 1222 events. 53/1222 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9426 event pairs, 4 based on Foata normal form. 0/1109 useless extension candidates. Maximal degree in co-relation 1415. Up to 50 conditions per place. [2025-02-08 05:38:18,340 INFO L140 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-02-08 05:38:18,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 260 transitions, 621 flow [2025-02-08 05:38:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-02-08 05:38:18,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512735326688815 [2025-02-08 05:38:18,342 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 605 flow. Second operand 3 states and 859 transitions. [2025-02-08 05:38:18,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 260 transitions, 621 flow [2025-02-08 05:38:18,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 260 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:18,346 INFO L231 Difference]: Finished difference. Result has 266 places, 260 transitions, 604 flow [2025-02-08 05:38:18,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=266, PETRI_TRANSITIONS=260} [2025-02-08 05:38:18,347 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:18,347 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 260 transitions, 604 flow [2025-02-08 05:38:18,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:18,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:18,348 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] [2025-02-08 05:38:18,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:18,348 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-02-08 05:38:18,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash -71115479, now seen corresponding path program 1 times [2025-02-08 05:38:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117721974] [2025-02-08 05:38:18,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:18,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:18,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:38:18,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:38:18,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:18,400 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:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117721974] [2025-02-08 05:38:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117721974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995616400] [2025-02-08 05:38:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:18,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:18,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:18,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:18,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 301 [2025-02-08 05:38:18,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 260 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:18,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:18,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 301 [2025-02-08 05:38:18,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:18,515 INFO L124 PetriNetUnfolderBase]: 47/997 cut-off events. [2025-02-08 05:38:18,516 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 997 events. 47/997 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7002 event pairs, 4 based on Foata normal form. 2/905 useless extension candidates. Maximal degree in co-relation 1172. Up to 42 conditions per place. [2025-02-08 05:38:18,523 INFO L140 encePairwiseOnDemand]: 299/301 looper letters, 0 selfloop transitions, 0 changer transitions 259/259 dead transitions. [2025-02-08 05:38:18,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 259 transitions, 618 flow [2025-02-08 05:38:18,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 858 transitions. [2025-02-08 05:38:18,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501661129568106 [2025-02-08 05:38:18,525 INFO L175 Difference]: Start difference. First operand has 266 places, 260 transitions, 604 flow. Second operand 3 states and 858 transitions. [2025-02-08 05:38:18,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 259 transitions, 618 flow [2025-02-08 05:38:18,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 259 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:18,528 INFO L231 Difference]: Finished difference. Result has 266 places, 0 transitions, 0 flow [2025-02-08 05:38:18,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=266, PETRI_TRANSITIONS=0} [2025-02-08 05:38:18,529 INFO L279 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2025-02-08 05:38:18,529 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 0 transitions, 0 flow [2025-02-08 05:38:18,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 48 remaining) [2025-02-08 05:38:18,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-02-08 05:38:18,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-02-08 05:38:18,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-02-08 05:38:18,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-02-08 05:38:18,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:18,536 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:18,542 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:18,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:18,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:18 BasicIcfg [2025-02-08 05:38:18,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:18,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:18,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:18,550 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:18,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:13" (3/4) ... [2025-02-08 05:38:18,552 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:18,554 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:18,554 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:18,555 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:38:18,558 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:38:18,558 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:18,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:18,560 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:18,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:18,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:18,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:18,639 INFO L158 Benchmark]: Toolchain (without parser) took 5591.44ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 123.4MB in the beginning and 303.5MB in the end (delta: -180.1MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,639 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:18,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.86ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.88ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,641 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 108.3MB in the end (delta: 678.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:18,641 INFO L158 Benchmark]: IcfgBuilder took 531.28ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 85.0MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,642 INFO L158 Benchmark]: TraceAbstraction took 4686.16ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 84.5MB in the beginning and 311.9MB in the end (delta: -227.4MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,642 INFO L158 Benchmark]: Witness Printer took 88.93ms. Allocated memory is still 394.3MB. Free memory was 311.9MB in the beginning and 303.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:18,643 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.86ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 111.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.88ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 108.3MB in the end (delta: 678.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 531.28ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 85.0MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4686.16ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 84.5MB in the beginning and 311.9MB in the end (delta: -227.4MB). Peak memory consumption was 189.6MB. Max. memory is 16.1GB. * Witness Printer took 88.93ms. Allocated memory is still 394.3MB. Free memory was 311.9MB in the beginning and 303.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 455 locations, 48 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 85 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=14, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:18,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE