./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-symm.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-exp-term-symm.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 a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:26,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:26,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:26,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:26,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:26,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:26,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:26,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:26,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:26,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:26,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:26,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:26,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:26,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:26,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:26,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:26,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:26,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:26,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:26,779 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 -> a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb [2025-02-08 05:37:26,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:26,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:26,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:26,955 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:26,955 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:26,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-02-08 05:37:28,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279d35330/a6fa91405bf24e53995baed52adb534b/FLAG79b13dad4 [2025-02-08 05:37:28,392 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:28,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-02-08 05:37:28,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279d35330/a6fa91405bf24e53995baed52adb534b/FLAG79b13dad4 [2025-02-08 05:37:28,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/279d35330/a6fa91405bf24e53995baed52adb534b [2025-02-08 05:37:28,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:28,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:28,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:28,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:28,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:28,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49396a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28, skipping insertion in model container [2025-02-08 05:37:28,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:28,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:28,572 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:28,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:28,608 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:28,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28 WrapperNode [2025-02-08 05:37:28,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:28,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:28,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:28,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:28,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,645 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 237 [2025-02-08 05:37:28,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:28,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:28,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:28,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:28,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:28,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:28,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:28,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:28,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (1/1) ... [2025-02-08 05:37:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:28,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:28,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:28,741 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:28,815 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:28,816 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:28,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-14: #t~ite5#1 := #t~ret4#1; [2025-02-08 05:37:28,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-15: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:37:28,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-16: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:28,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-17: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:28,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-18: #t~ret4#1 := minus_#res#1; [2025-02-08 05:37:29,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-14: #t~ite13#1 := #t~ret12#1; [2025-02-08 05:37:29,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-15: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:37:29,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-16: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:29,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:29,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: #t~ret12#1 := minus_#res#1; [2025-02-08 05:37:29,146 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:29,146 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:29,160 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:29,160 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:29,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:29 BoogieIcfgContainer [2025-02-08 05:37:29,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:29,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:29,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:29,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:28" (1/3) ... [2025-02-08 05:37:29,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441fe519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:29, skipping insertion in model container [2025-02-08 05:37:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:28" (2/3) ... [2025-02-08 05:37:29,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441fe519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:29, skipping insertion in model container [2025-02-08 05:37:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:29" (3/3) ... [2025-02-08 05:37:29,167 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-symm.wvr.c [2025-02-08 05:37:29,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:29,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-symm.wvr.c that has 3 procedures, 296 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-02-08 05:37:29,180 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:29,294 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 315 transitions, 644 flow [2025-02-08 05:37:29,437 INFO L124 PetriNetUnfolderBase]: 20/313 cut-off events. [2025-02-08 05:37:29,439 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:29,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 313 events. 20/313 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 771 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 192. Up to 2 conditions per place. [2025-02-08 05:37:29,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 315 transitions, 644 flow [2025-02-08 05:37:29,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 293 transitions, 598 flow [2025-02-08 05:37:29,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:29,474 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;@95bde16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:29,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-08 05:37:29,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:29,479 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:37:29,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:29,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,480 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] [2025-02-08 05:37:29,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:29,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash 753275920, now seen corresponding path program 1 times [2025-02-08 05:37:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411734348] [2025-02-08 05:37:29,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:37:29,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:37:29,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411734348] [2025-02-08 05:37:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411734348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778884680] [2025-02-08 05:37:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:29,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:29,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 315 [2025-02-08 05:37:29,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 293 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 315 [2025-02-08 05:37:29,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,841 INFO L124 PetriNetUnfolderBase]: 34/543 cut-off events. [2025-02-08 05:37:29,841 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-02-08 05:37:29,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 543 events. 34/543 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2458 event pairs, 8 based on Foata normal form. 16/456 useless extension candidates. Maximal degree in co-relation 399. Up to 30 conditions per place. [2025-02-08 05:37:29,846 INFO L140 encePairwiseOnDemand]: 306/315 looper letters, 11 selfloop transitions, 2 changer transitions 2/286 dead transitions. [2025-02-08 05:37:29,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 286 transitions, 610 flow [2025-02-08 05:37:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 896 transitions. [2025-02-08 05:37:29,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9481481481481482 [2025-02-08 05:37:29,860 INFO L175 Difference]: Start difference. First operand has 282 places, 293 transitions, 598 flow. Second operand 3 states and 896 transitions. [2025-02-08 05:37:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 286 transitions, 610 flow [2025-02-08 05:37:29,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 286 transitions, 602 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:29,876 INFO L231 Difference]: Finished difference. Result has 279 places, 284 transitions, 576 flow [2025-02-08 05:37:29,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=279, PETRI_TRANSITIONS=284} [2025-02-08 05:37:29,883 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2025-02-08 05:37:29,883 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 284 transitions, 576 flow [2025-02-08 05:37:29,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,884 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] [2025-02-08 05:37:29,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:29,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:29,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1489521631, now seen corresponding path program 1 times [2025-02-08 05:37:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133036572] [2025-02-08 05:37:29,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:37:29,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:37:29,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133036572] [2025-02-08 05:37:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133036572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565546017] [2025-02-08 05:37:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:29,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:29,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 315 [2025-02-08 05:37:29,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 284 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 315 [2025-02-08 05:37:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,033 INFO L124 PetriNetUnfolderBase]: 34/543 cut-off events. [2025-02-08 05:37:30,033 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:37:30,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 543 events. 34/543 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2434 event pairs, 8 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 553. Up to 30 conditions per place. [2025-02-08 05:37:30,038 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 11 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-08 05:37:30,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 283 transitions, 600 flow [2025-02-08 05:37:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2025-02-08 05:37:30,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9417989417989417 [2025-02-08 05:37:30,042 INFO L175 Difference]: Start difference. First operand has 279 places, 284 transitions, 576 flow. Second operand 3 states and 890 transitions. [2025-02-08 05:37:30,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 283 transitions, 600 flow [2025-02-08 05:37:30,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 283 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,070 INFO L231 Difference]: Finished difference. Result has 276 places, 283 transitions, 574 flow [2025-02-08 05:37:30,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=276, PETRI_TRANSITIONS=283} [2025-02-08 05:37:30,071 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2025-02-08 05:37:30,071 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 283 transitions, 574 flow [2025-02-08 05:37:30,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,072 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] [2025-02-08 05:37:30,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:30,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1433190950, now seen corresponding path program 1 times [2025-02-08 05:37:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479352421] [2025-02-08 05:37:30,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:37:30,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:37:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479352421] [2025-02-08 05:37:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479352421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011153171] [2025-02-08 05:37:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 315 [2025-02-08 05:37:30,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 283 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 315 [2025-02-08 05:37:30,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,230 INFO L124 PetriNetUnfolderBase]: 47/652 cut-off events. [2025-02-08 05:37:30,230 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:30,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 652 events. 47/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3506 event pairs, 15 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 669. Up to 44 conditions per place. [2025-02-08 05:37:30,235 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-02-08 05:37:30,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 282 transitions, 602 flow [2025-02-08 05:37:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-02-08 05:37:30,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375661375661376 [2025-02-08 05:37:30,239 INFO L175 Difference]: Start difference. First operand has 276 places, 283 transitions, 574 flow. Second operand 3 states and 886 transitions. [2025-02-08 05:37:30,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 282 transitions, 602 flow [2025-02-08 05:37:30,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 282 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,243 INFO L231 Difference]: Finished difference. Result has 275 places, 282 transitions, 572 flow [2025-02-08 05:37:30,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=275, PETRI_TRANSITIONS=282} [2025-02-08 05:37:30,244 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2025-02-08 05:37:30,244 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 282 transitions, 572 flow [2025-02-08 05:37:30,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,245 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] [2025-02-08 05:37:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:30,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1493585695, now seen corresponding path program 1 times [2025-02-08 05:37:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911022897] [2025-02-08 05:37:30,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911022897] [2025-02-08 05:37:30,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911022897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476938339] [2025-02-08 05:37:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 315 [2025-02-08 05:37:30,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 315 [2025-02-08 05:37:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,374 INFO L124 PetriNetUnfolderBase]: 47/639 cut-off events. [2025-02-08 05:37:30,374 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:30,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 639 events. 47/639 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3525 event pairs, 15 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 648. Up to 44 conditions per place. [2025-02-08 05:37:30,377 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 13 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-08 05:37:30,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 281 transitions, 600 flow [2025-02-08 05:37:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2025-02-08 05:37:30,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375661375661376 [2025-02-08 05:37:30,380 INFO L175 Difference]: Start difference. First operand has 275 places, 282 transitions, 572 flow. Second operand 3 states and 886 transitions. [2025-02-08 05:37:30,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 281 transitions, 600 flow [2025-02-08 05:37:30,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 281 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,383 INFO L231 Difference]: Finished difference. Result has 274 places, 281 transitions, 570 flow [2025-02-08 05:37:30,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=274, PETRI_TRANSITIONS=281} [2025-02-08 05:37:30,384 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2025-02-08 05:37:30,384 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 281 transitions, 570 flow [2025-02-08 05:37:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,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] [2025-02-08 05:37:30,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:30,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1234712039, now seen corresponding path program 1 times [2025-02-08 05:37:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185114149] [2025-02-08 05:37:30,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:37:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:37:30,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185114149] [2025-02-08 05:37:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185114149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010397162] [2025-02-08 05:37:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 315 [2025-02-08 05:37:30,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 315 [2025-02-08 05:37:30,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,521 INFO L124 PetriNetUnfolderBase]: 105/1067 cut-off events. [2025-02-08 05:37:30,521 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:37:30,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 1067 events. 105/1067 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7242 event pairs, 41 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1139. Up to 110 conditions per place. [2025-02-08 05:37:30,526 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 18 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-02-08 05:37:30,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 278 transitions, 605 flow [2025-02-08 05:37:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-02-08 05:37:30,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291005291005291 [2025-02-08 05:37:30,528 INFO L175 Difference]: Start difference. First operand has 274 places, 281 transitions, 570 flow. Second operand 3 states and 878 transitions. [2025-02-08 05:37:30,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 278 transitions, 605 flow [2025-02-08 05:37:30,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 278 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:30,532 INFO L231 Difference]: Finished difference. Result has 269 places, 277 transitions, 568 flow [2025-02-08 05:37:30,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=269, PETRI_TRANSITIONS=277} [2025-02-08 05:37:30,533 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-02-08 05:37:30,533 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 277 transitions, 568 flow [2025-02-08 05:37:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,534 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] [2025-02-08 05:37:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:30,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1147276198, now seen corresponding path program 1 times [2025-02-08 05:37:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463644287] [2025-02-08 05:37:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:37:30,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:37:30,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463644287] [2025-02-08 05:37:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463644287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548807968] [2025-02-08 05:37:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 315 [2025-02-08 05:37:30,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 277 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 315 [2025-02-08 05:37:30,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,701 INFO L124 PetriNetUnfolderBase]: 130/1329 cut-off events. [2025-02-08 05:37:30,701 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:37:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1329 events. 130/1329 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9847 event pairs, 41 based on Foata normal form. 0/1119 useless extension candidates. Maximal degree in co-relation 1330. Up to 126 conditions per place. [2025-02-08 05:37:30,709 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 18 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-08 05:37:30,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 274 transitions, 603 flow [2025-02-08 05:37:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-02-08 05:37:30,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291005291005291 [2025-02-08 05:37:30,711 INFO L175 Difference]: Start difference. First operand has 269 places, 277 transitions, 568 flow. Second operand 3 states and 878 transitions. [2025-02-08 05:37:30,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 274 transitions, 603 flow [2025-02-08 05:37:30,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 274 transitions, 603 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:30,715 INFO L231 Difference]: Finished difference. Result has 266 places, 273 transitions, 570 flow [2025-02-08 05:37:30,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=266, PETRI_TRANSITIONS=273} [2025-02-08 05:37:30,716 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -16 predicate places. [2025-02-08 05:37:30,716 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 273 transitions, 570 flow [2025-02-08 05:37:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,717 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] [2025-02-08 05:37:30,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:30,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2030678444, now seen corresponding path program 1 times [2025-02-08 05:37:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161988380] [2025-02-08 05:37:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:37:30,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:37:30,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161988380] [2025-02-08 05:37:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161988380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102680972] [2025-02-08 05:37:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 315 [2025-02-08 05:37:30,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 273 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 315 [2025-02-08 05:37:30,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,825 INFO L124 PetriNetUnfolderBase]: 36/536 cut-off events. [2025-02-08 05:37:30,826 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:30,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 536 events. 36/536 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2730 event pairs, 5 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 445. Up to 22 conditions per place. [2025-02-08 05:37:30,830 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 11 selfloop transitions, 3 changer transitions 0/276 dead transitions. [2025-02-08 05:37:30,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 276 transitions, 605 flow [2025-02-08 05:37:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-08 05:37:30,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-02-08 05:37:30,833 INFO L175 Difference]: Start difference. First operand has 266 places, 273 transitions, 570 flow. Second operand 3 states and 903 transitions. [2025-02-08 05:37:30,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 276 transitions, 605 flow [2025-02-08 05:37:30,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 605 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:30,837 INFO L231 Difference]: Finished difference. Result has 270 places, 275 transitions, 592 flow [2025-02-08 05:37:30,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=270, PETRI_TRANSITIONS=275} [2025-02-08 05:37:30,838 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2025-02-08 05:37:30,838 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 275 transitions, 592 flow [2025-02-08 05:37:30,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:30,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:30,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -174048819, now seen corresponding path program 1 times [2025-02-08 05:37:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341178583] [2025-02-08 05:37:30,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:37:30,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:37:30,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341178583] [2025-02-08 05:37:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341178583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:30,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236182803] [2025-02-08 05:37:30,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:30,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:30,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 315 [2025-02-08 05:37:30,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 275 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:30,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:30,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 315 [2025-02-08 05:37:30,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,016 INFO L124 PetriNetUnfolderBase]: 91/1160 cut-off events. [2025-02-08 05:37:31,016 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-02-08 05:37:31,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 1160 events. 91/1160 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7872 event pairs, 10 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1123. Up to 87 conditions per place. [2025-02-08 05:37:31,023 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 16 selfloop transitions, 4 changer transitions 0/278 dead transitions. [2025-02-08 05:37:31,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 278 transitions, 641 flow [2025-02-08 05:37:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-02-08 05:37:31,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946031746031746 [2025-02-08 05:37:31,025 INFO L175 Difference]: Start difference. First operand has 270 places, 275 transitions, 592 flow. Second operand 3 states and 894 transitions. [2025-02-08 05:37:31,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 278 transitions, 641 flow [2025-02-08 05:37:31,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 278 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,029 INFO L231 Difference]: Finished difference. Result has 267 places, 275 transitions, 606 flow [2025-02-08 05:37:31,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=267, PETRI_TRANSITIONS=275} [2025-02-08 05:37:31,030 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2025-02-08 05:37:31,030 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 275 transitions, 606 flow [2025-02-08 05:37:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,031 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] [2025-02-08 05:37:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:31,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 242830578, now seen corresponding path program 1 times [2025-02-08 05:37:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761830569] [2025-02-08 05:37:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:37:31,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:37:31,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761830569] [2025-02-08 05:37:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761830569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541195864] [2025-02-08 05:37:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 315 [2025-02-08 05:37:31,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 275 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 315 [2025-02-08 05:37:31,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,220 INFO L124 PetriNetUnfolderBase]: 109/1276 cut-off events. [2025-02-08 05:37:31,221 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-02-08 05:37:31,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1276 events. 109/1276 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9219 event pairs, 14 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 1287. Up to 99 conditions per place. [2025-02-08 05:37:31,225 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 16 selfloop transitions, 4 changer transitions 0/278 dead transitions. [2025-02-08 05:37:31,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 278 transitions, 655 flow [2025-02-08 05:37:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-02-08 05:37:31,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946031746031746 [2025-02-08 05:37:31,227 INFO L175 Difference]: Start difference. First operand has 267 places, 275 transitions, 606 flow. Second operand 3 states and 894 transitions. [2025-02-08 05:37:31,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 278 transitions, 655 flow [2025-02-08 05:37:31,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 278 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:31,230 INFO L231 Difference]: Finished difference. Result has 266 places, 275 transitions, 626 flow [2025-02-08 05:37:31,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=266, PETRI_TRANSITIONS=275} [2025-02-08 05:37:31,231 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -16 predicate places. [2025-02-08 05:37:31,231 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 275 transitions, 626 flow [2025-02-08 05:37:31,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,232 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] [2025-02-08 05:37:31,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:31,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1131582439, now seen corresponding path program 1 times [2025-02-08 05:37:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18502606] [2025-02-08 05:37:31,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:37:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:37:31,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18502606] [2025-02-08 05:37:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18502606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019411748] [2025-02-08 05:37:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 315 [2025-02-08 05:37:31,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 275 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 315 [2025-02-08 05:37:31,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,355 INFO L124 PetriNetUnfolderBase]: 100/1195 cut-off events. [2025-02-08 05:37:31,356 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-02-08 05:37:31,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1195 events. 100/1195 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8212 event pairs, 6 based on Foata normal form. 2/1068 useless extension candidates. Maximal degree in co-relation 1216. Up to 38 conditions per place. [2025-02-08 05:37:31,363 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 10 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-02-08 05:37:31,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 275 transitions, 651 flow [2025-02-08 05:37:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-02-08 05:37:31,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502645502645503 [2025-02-08 05:37:31,365 INFO L175 Difference]: Start difference. First operand has 266 places, 275 transitions, 626 flow. Second operand 3 states and 898 transitions. [2025-02-08 05:37:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 275 transitions, 651 flow [2025-02-08 05:37:31,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 275 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:31,369 INFO L231 Difference]: Finished difference. Result has 267 places, 274 transitions, 628 flow [2025-02-08 05:37:31,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=267, PETRI_TRANSITIONS=274} [2025-02-08 05:37:31,370 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2025-02-08 05:37:31,370 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 274 transitions, 628 flow [2025-02-08 05:37:31,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:31,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 831879487, now seen corresponding path program 1 times [2025-02-08 05:37:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284097108] [2025-02-08 05:37:31,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:37:31,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:37:31,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,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:37:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284097108] [2025-02-08 05:37:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284097108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:31,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292276680] [2025-02-08 05:37:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 315 [2025-02-08 05:37:31,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 274 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 315 [2025-02-08 05:37:31,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,482 INFO L124 PetriNetUnfolderBase]: 95/1113 cut-off events. [2025-02-08 05:37:31,483 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-02-08 05:37:31,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 1113 events. 95/1113 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7377 event pairs, 10 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1125. Up to 81 conditions per place. [2025-02-08 05:37:31,489 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 11 selfloop transitions, 3 changer transitions 0/277 dead transitions. [2025-02-08 05:37:31,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 277 transitions, 663 flow [2025-02-08 05:37:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-08 05:37:31,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-02-08 05:37:31,491 INFO L175 Difference]: Start difference. First operand has 267 places, 274 transitions, 628 flow. Second operand 3 states and 903 transitions. [2025-02-08 05:37:31,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 277 transitions, 663 flow [2025-02-08 05:37:31,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 277 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,494 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 646 flow [2025-02-08 05:37:31,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2025-02-08 05:37:31,495 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2025-02-08 05:37:31,495 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 646 flow [2025-02-08 05:37:31,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:31,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:31,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash 874508524, now seen corresponding path program 1 times [2025-02-08 05:37:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760899990] [2025-02-08 05:37:31,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:37:31,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:37:31,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760899990] [2025-02-08 05:37:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760899990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109419127] [2025-02-08 05:37:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 315 [2025-02-08 05:37:31,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 315 [2025-02-08 05:37:31,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,621 INFO L124 PetriNetUnfolderBase]: 96/998 cut-off events. [2025-02-08 05:37:31,621 INFO L125 PetriNetUnfolderBase]: For 57/59 co-relation queries the response was YES. [2025-02-08 05:37:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 998 events. 96/998 cut-off events. For 57/59 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6429 event pairs, 6 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1076. Up to 65 conditions per place. [2025-02-08 05:37:31,628 INFO L140 encePairwiseOnDemand]: 312/315 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-02-08 05:37:31,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 276 transitions, 671 flow [2025-02-08 05:37:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2025-02-08 05:37:31,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502645502645503 [2025-02-08 05:37:31,630 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 646 flow. Second operand 3 states and 898 transitions. [2025-02-08 05:37:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 276 transitions, 671 flow [2025-02-08 05:37:31,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,634 INFO L231 Difference]: Finished difference. Result has 268 places, 275 transitions, 642 flow [2025-02-08 05:37:31,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=268, PETRI_TRANSITIONS=275} [2025-02-08 05:37:31,635 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -14 predicate places. [2025-02-08 05:37:31,635 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 275 transitions, 642 flow [2025-02-08 05:37:31,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,636 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] [2025-02-08 05:37:31,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:31,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1045863487, now seen corresponding path program 1 times [2025-02-08 05:37:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619569619] [2025-02-08 05:37:31,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:37:31,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:37:31,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619569619] [2025-02-08 05:37:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619569619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422532419] [2025-02-08 05:37:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 315 [2025-02-08 05:37:31,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 275 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 315 [2025-02-08 05:37:31,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,784 INFO L124 PetriNetUnfolderBase]: 89/1237 cut-off events. [2025-02-08 05:37:31,784 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-02-08 05:37:31,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1237 events. 89/1237 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8673 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1304. Up to 43 conditions per place. [2025-02-08 05:37:31,790 INFO L140 encePairwiseOnDemand]: 311/315 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-02-08 05:37:31,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 272 transitions, 658 flow [2025-02-08 05:37:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-02-08 05:37:31,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944973544973545 [2025-02-08 05:37:31,792 INFO L175 Difference]: Start difference. First operand has 268 places, 275 transitions, 642 flow. Second operand 3 states and 893 transitions. [2025-02-08 05:37:31,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 272 transitions, 658 flow [2025-02-08 05:37:31,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 272 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:31,796 INFO L231 Difference]: Finished difference. Result has 265 places, 272 transitions, 634 flow [2025-02-08 05:37:31,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=265, PETRI_TRANSITIONS=272} [2025-02-08 05:37:31,797 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -17 predicate places. [2025-02-08 05:37:31,797 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 272 transitions, 634 flow [2025-02-08 05:37:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,798 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] [2025-02-08 05:37:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:31,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:37:31,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -735352674, now seen corresponding path program 1 times [2025-02-08 05:37:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122839912] [2025-02-08 05:37:31,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:31,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:31,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122839912] [2025-02-08 05:37:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122839912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:31,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:31,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119449699] [2025-02-08 05:37:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:31,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:31,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:31,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:31,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 315 [2025-02-08 05:37:31,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 272 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 315 [2025-02-08 05:37:31,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,907 INFO L124 PetriNetUnfolderBase]: 78/1009 cut-off events. [2025-02-08 05:37:31,907 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-02-08 05:37:31,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 1009 events. 78/1009 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6072 event pairs, 4 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 1080. Up to 44 conditions per place. [2025-02-08 05:37:31,911 INFO L140 encePairwiseOnDemand]: 309/315 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2025-02-08 05:37:31,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 271 transitions, 656 flow [2025-02-08 05:37:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-02-08 05:37:31,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946031746031746 [2025-02-08 05:37:31,913 INFO L175 Difference]: Start difference. First operand has 265 places, 272 transitions, 634 flow. Second operand 3 states and 894 transitions. [2025-02-08 05:37:31,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 271 transitions, 656 flow [2025-02-08 05:37:31,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 271 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:31,915 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2025-02-08 05:37:31,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2025-02-08 05:37:31,916 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -19 predicate places. [2025-02-08 05:37:31,916 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2025-02-08 05:37:31,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (55 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2025-02-08 05:37:31,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2025-02-08 05:37:31,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2025-02-08 05:37:31,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2025-02-08 05:37:31,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2025-02-08 05:37:31,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2025-02-08 05:37:31,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:31,923 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:31,926 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:31,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:31,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:31 BasicIcfg [2025-02-08 05:37:31,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:31,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:31,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:31,930 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:31,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:29" (3/4) ... [2025-02-08 05:37:31,931 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:31,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:31,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:31,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:37:31,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:31,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:31,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:31,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:31,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:31,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:31,985 INFO L158 Benchmark]: Toolchain (without parser) took 3562.84ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.8MB in the beginning and 189.3MB in the end (delta: -82.5MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.33ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.69ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: Boogie Preprocessor took 22.53ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.6MB in the end (delta: 852.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: IcfgBuilder took 488.69ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:31,986 INFO L158 Benchmark]: TraceAbstraction took 2767.33ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 68.2MB in the beginning and 193.9MB in the end (delta: -125.7MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:31,987 INFO L158 Benchmark]: Witness Printer took 55.01ms. Allocated memory is still 352.3MB. Free memory was 193.9MB in the beginning and 189.3MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:31,988 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.33ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.69ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.53ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.6MB in the end (delta: 852.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 488.69ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2767.33ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 68.2MB in the beginning and 193.9MB in the end (delta: -125.7MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Witness Printer took 55.01ms. Allocated memory is still 352.3MB. Free memory was 193.9MB in the beginning and 189.3MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 468 locations, 56 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: 2.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 77 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:31,999 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