./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series.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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:21,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:21,890 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:40:21,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:21,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:21,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:21,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:21,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:21,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:21,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:21,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:21,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:21,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:21,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:21,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:21,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:21,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:21,909 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2025-02-08 05:40:22,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:22,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:22,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:22,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:22,078 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:22,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-02-08 05:40:23,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff5daa4b0/fb3e86d38a654933bf334446e709b42a/FLAG4900cfade [2025-02-08 05:40:23,589 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:23,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-02-08 05:40:23,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff5daa4b0/fb3e86d38a654933bf334446e709b42a/FLAG4900cfade [2025-02-08 05:40:23,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff5daa4b0/fb3e86d38a654933bf334446e709b42a [2025-02-08 05:40:23,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:23,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:23,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:23,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:23,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:23,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:23" (1/1) ... [2025-02-08 05:40:23,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b52ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:23, skipping insertion in model container [2025-02-08 05:40:23,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:23" (1/1) ... [2025-02-08 05:40:23,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:24,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:24,082 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:24,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:24,118 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:24,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24 WrapperNode [2025-02-08 05:40:24,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:24,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:24,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:24,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:24,123 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:40:24" (1/1) ... [2025-02-08 05:40:24,131 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:40:24" (1/1) ... [2025-02-08 05:40:24,155 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 631 [2025-02-08 05:40:24,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:24,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:24,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:24,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:24,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:24,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:24,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:24,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:24,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (1/1) ... [2025-02-08 05:40:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:24,237 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:40:24,239 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:40:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:40:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:24,262 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:40:24,361 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:24,363 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:24,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: #race~i~0 := 0; [2025-02-08 05:40:24,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc #t~short24#1; [2025-02-08 05:40:24,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-1: ~cond~2#1 := (if 0 == (if #t~short24#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:24,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-2: assume 0 == #race~q1_back~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-2: assume !(0 == #race~q1_back~0); [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-3: #t~short24#1 := ~q1_front~0 < ~q1_back~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-4: assume 0 == #race~q1_front~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-4: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-5: #race~q1_back~0 := 0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-6: assume #t~short24#1; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-6: assume !#t~short24#1; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-7: #race~q1_front~0 := 0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-8: assume 0 == #race~N~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-8: assume !(0 == #race~N~0); [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-9: #t~short24#1 := ~i~0 < ~N~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-10: assume 0 == #race~i~0; [2025-02-08 05:40:24,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-10: assume !(0 == #race~i~0); [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-11: #race~N~0 := 0; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc #t~nondet21#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-1: havoc #t~ret20#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-2: assume #race~total~0 == #t~nondet21#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-2: assume !(#race~total~0 == #t~nondet21#1); [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-3: havoc #t~mem19#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-4: #race~total~0 := #t~nondet21#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-5: havoc #t~nondet21#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-6: ~total~0 := #t~ret20#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L99-10: #t~ret20#1 := plus_#res#1; [2025-02-08 05:40:24,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc #t~nondet23#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: assume #race~q1_front~0 == #t~nondet23#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-1: assume !(#race~q1_front~0 == #t~nondet23#1); [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-2: havoc #t~post22#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-3: #race~q1_front~0 := #t~nondet23#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-4: havoc #t~nondet23#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-5: ~q1_front~0 := 1 + #t~post22#1; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-6: assume 0 == #race~q1_front~0; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-6: assume !(0 == #race~q1_front~0); [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-7: #t~post22#1 := ~q1_front~0; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L100-8: #race~q1_front~0 := 0; [2025-02-08 05:40:24,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: [2025-02-08 05:40:25,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc #t~nondet32#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: assume #race~q2_front~0 == #t~nondet32#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: assume !(#race~q2_front~0 == #t~nondet32#1); [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-2: havoc #t~post31#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-3: #race~q2_front~0 := #t~nondet32#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-4: havoc #t~nondet32#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-5: ~q2_front~0 := 1 + #t~post31#1; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-6: assume 0 == #race~q2_front~0; [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-6: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:25,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-7: #t~post31#1 := ~q2_front~0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-8: #race~q2_front~0 := 0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120: #race~j~0 := 0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc #t~short33#1; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-1: ~cond~3#1 := (if 0 == (if #t~short33#1 then 1 else 0) then 0 else 1); [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-2: assume 0 == #race~q2_back~0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-2: assume !(0 == #race~q2_back~0); [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-3: #t~short33#1 := ~q2_front~0 < ~q2_back~0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume 0 == #race~q2_front~0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-4: assume !(0 == #race~q2_front~0); [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-5: #race~q2_back~0 := 0; [2025-02-08 05:40:25,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: assume #t~short33#1; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-6: assume !#t~short33#1; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-7: #race~q2_front~0 := 0; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume 0 == #race~N~0; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-8: assume !(0 == #race~N~0); [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-9: #t~short33#1 := ~j~0 < ~N~0; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume 0 == #race~j~0; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume !(0 == #race~j~0); [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: #race~N~0 := 0; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc #t~nondet30#1; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-1: havoc #t~ret29#1; [2025-02-08 05:40:25,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-2: assume #race~total~0 == #t~nondet30#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-2: assume !(#race~total~0 == #t~nondet30#1); [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-3: havoc #t~mem28#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-4: #race~total~0 := #t~nondet30#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-5: havoc #t~nondet30#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-6: ~total~0 := #t~ret29#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:25,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L117-10: #t~ret29#1 := plus_#res#1; [2025-02-08 05:40:25,006 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:25,006 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:25,401 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L174 is not an error location. [2025-02-08 05:40:25,402 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L174 is not an error location. [2025-02-08 05:40:25,402 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:25,404 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:25,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:25 BoogieIcfgContainer [2025-02-08 05:40:25,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:25,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:25,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:25,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:25,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:23" (1/3) ... [2025-02-08 05:40:25,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268c08ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:25, skipping insertion in model container [2025-02-08 05:40:25,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:24" (2/3) ... [2025-02-08 05:40:25,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268c08ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:25, skipping insertion in model container [2025-02-08 05:40:25,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:25" (3/3) ... [2025-02-08 05:40:25,413 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-02-08 05:40:25,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:25,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 403 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-02-08 05:40:25,426 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:25,553 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:40:25,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 415 transitions, 858 flow [2025-02-08 05:40:25,670 INFO L124 PetriNetUnfolderBase]: 13/411 cut-off events. [2025-02-08 05:40:25,672 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:25,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 411 events. 13/411 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 609 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 371. Up to 2 conditions per place. [2025-02-08 05:40:25,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 415 places, 415 transitions, 858 flow [2025-02-08 05:40:25,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 394 transitions, 812 flow [2025-02-08 05:40:25,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:25,713 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;@f30618c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:25,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 154 error locations. [2025-02-08 05:40:25,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:25,721 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:40:25,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:25,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,722 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] [2025-02-08 05:40:25,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:25,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2035547138, now seen corresponding path program 1 times [2025-02-08 05:40:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950586491] [2025-02-08 05:40:25,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:25,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:25,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,855 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:40:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950586491] [2025-02-08 05:40:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950586491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784103934] [2025-02-08 05:40:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 415 [2025-02-08 05:40:25,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 394 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:40:25,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 415 [2025-02-08 05:40:25,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,314 INFO L124 PetriNetUnfolderBase]: 602/1557 cut-off events. [2025-02-08 05:40:26,314 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-08 05:40:26,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 1557 events. 602/1557 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8659 event pairs, 485 based on Foata normal form. 7/1404 useless extension candidates. Maximal degree in co-relation 2224. Up to 866 conditions per place. [2025-02-08 05:40:26,323 INFO L140 encePairwiseOnDemand]: 340/415 looper letters, 23 selfloop transitions, 2 changer transitions 9/321 dead transitions. [2025-02-08 05:40:26,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 321 transitions, 720 flow [2025-02-08 05:40:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1036 transitions. [2025-02-08 05:40:26,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8321285140562249 [2025-02-08 05:40:26,360 INFO L175 Difference]: Start difference. First operand has 395 places, 394 transitions, 812 flow. Second operand 3 states and 1036 transitions. [2025-02-08 05:40:26,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 321 transitions, 720 flow [2025-02-08 05:40:26,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 321 transitions, 704 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:40:26,369 INFO L231 Difference]: Finished difference. Result has 323 places, 312 transitions, 636 flow [2025-02-08 05:40:26,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=323, PETRI_TRANSITIONS=312} [2025-02-08 05:40:26,373 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -72 predicate places. [2025-02-08 05:40:26,374 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 312 transitions, 636 flow [2025-02-08 05:40:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:40:26,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:26,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1689255392, now seen corresponding path program 1 times [2025-02-08 05:40:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861540996] [2025-02-08 05:40:26,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:40:26,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:40:26,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,410 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:40:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861540996] [2025-02-08 05:40:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861540996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275792421] [2025-02-08 05:40:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 415 [2025-02-08 05:40:26,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 312 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:26,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 415 [2025-02-08 05:40:26,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,620 INFO L124 PetriNetUnfolderBase]: 285/982 cut-off events. [2025-02-08 05:40:26,620 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:26,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 982 events. 285/982 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4577 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1428. Up to 426 conditions per place. [2025-02-08 05:40:26,625 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-02-08 05:40:26,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 682 flow [2025-02-08 05:40:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:26,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742971887550201 [2025-02-08 05:40:26,627 INFO L175 Difference]: Start difference. First operand has 323 places, 312 transitions, 636 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:26,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 682 flow [2025-02-08 05:40:26,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:26,632 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 634 flow [2025-02-08 05:40:26,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2025-02-08 05:40:26,633 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -82 predicate places. [2025-02-08 05:40:26,633 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 634 flow [2025-02-08 05:40:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:26,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,634 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] [2025-02-08 05:40:26,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:26,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:26,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2086327356, now seen corresponding path program 1 times [2025-02-08 05:40:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657749927] [2025-02-08 05:40:26,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:40:26,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:40:26,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:26,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657749927] [2025-02-08 05:40:26,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657749927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476631124] [2025-02-08 05:40:26,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 415 [2025-02-08 05:40:26,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:26,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 415 [2025-02-08 05:40:26,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,877 INFO L124 PetriNetUnfolderBase]: 285/981 cut-off events. [2025-02-08 05:40:26,878 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:26,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 981 events. 285/981 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4573 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1419. Up to 426 conditions per place. [2025-02-08 05:40:26,884 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-08 05:40:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 310 transitions, 680 flow [2025-02-08 05:40:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:26,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742971887550201 [2025-02-08 05:40:26,887 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 634 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:26,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 310 transitions, 680 flow [2025-02-08 05:40:26,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:26,892 INFO L231 Difference]: Finished difference. Result has 312 places, 310 transitions, 632 flow [2025-02-08 05:40:26,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=312, PETRI_TRANSITIONS=310} [2025-02-08 05:40:26,893 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -83 predicate places. [2025-02-08 05:40:26,893 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 310 transitions, 632 flow [2025-02-08 05:40:26,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:26,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,894 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:40:26,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:26,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:26,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash -401060591, now seen corresponding path program 1 times [2025-02-08 05:40:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011652338] [2025-02-08 05:40:26,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:40:26,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:40:26,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,935 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:40:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011652338] [2025-02-08 05:40:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011652338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227684600] [2025-02-08 05:40:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 415 [2025-02-08 05:40:26,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 310 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:26,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 415 [2025-02-08 05:40:26,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,136 INFO L124 PetriNetUnfolderBase]: 285/980 cut-off events. [2025-02-08 05:40:27,136 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:27,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 980 events. 285/980 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4574 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1410. Up to 426 conditions per place. [2025-02-08 05:40:27,142 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-08 05:40:27,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 678 flow [2025-02-08 05:40:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:27,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742971887550201 [2025-02-08 05:40:27,145 INFO L175 Difference]: Start difference. First operand has 312 places, 310 transitions, 632 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:27,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 678 flow [2025-02-08 05:40:27,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:27,150 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 630 flow [2025-02-08 05:40:27,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2025-02-08 05:40:27,151 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -84 predicate places. [2025-02-08 05:40:27,151 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 630 flow [2025-02-08 05:40:27,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:27,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,151 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] [2025-02-08 05:40:27,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:27,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1561404060, now seen corresponding path program 1 times [2025-02-08 05:40:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474048606] [2025-02-08 05:40:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:40:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:40:27,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,198 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:40:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474048606] [2025-02-08 05:40:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474048606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577757708] [2025-02-08 05:40:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 415 [2025-02-08 05:40:27,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:27,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 415 [2025-02-08 05:40:27,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,434 INFO L124 PetriNetUnfolderBase]: 285/979 cut-off events. [2025-02-08 05:40:27,434 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:40:27,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 979 events. 285/979 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4566 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1398. Up to 423 conditions per place. [2025-02-08 05:40:27,442 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 20 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2025-02-08 05:40:27,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 670 flow [2025-02-08 05:40:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:40:27,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815261044176707 [2025-02-08 05:40:27,444 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 630 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:40:27,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 670 flow [2025-02-08 05:40:27,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:27,450 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 626 flow [2025-02-08 05:40:27,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=310, PETRI_TRANSITIONS=308} [2025-02-08 05:40:27,451 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -85 predicate places. [2025-02-08 05:40:27,451 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 626 flow [2025-02-08 05:40:27,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:27,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,452 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] [2025-02-08 05:40:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:27,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1463803597, now seen corresponding path program 1 times [2025-02-08 05:40:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835546850] [2025-02-08 05:40:27,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:40:27,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:40:27,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,508 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:40:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835546850] [2025-02-08 05:40:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835546850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81581521] [2025-02-08 05:40:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:27,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:27,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:27,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,632 INFO L124 PetriNetUnfolderBase]: 285/978 cut-off events. [2025-02-08 05:40:27,632 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:27,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 978 events. 285/978 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4576 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1398. Up to 425 conditions per place. [2025-02-08 05:40:27,636 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2025-02-08 05:40:27,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 307 transitions, 670 flow [2025-02-08 05:40:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:40:27,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7759036144578313 [2025-02-08 05:40:27,638 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 626 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:40:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 307 transitions, 670 flow [2025-02-08 05:40:27,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 307 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:27,642 INFO L231 Difference]: Finished difference. Result has 310 places, 307 transitions, 627 flow [2025-02-08 05:40:27,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=310, PETRI_TRANSITIONS=307} [2025-02-08 05:40:27,643 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -85 predicate places. [2025-02-08 05:40:27,643 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 307 transitions, 627 flow [2025-02-08 05:40:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:27,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,643 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] [2025-02-08 05:40:27,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:27,644 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1326893844, now seen corresponding path program 1 times [2025-02-08 05:40:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697339802] [2025-02-08 05:40:27,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:40:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:40:27,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697339802] [2025-02-08 05:40:27,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697339802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320059770] [2025-02-08 05:40:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 415 [2025-02-08 05:40:27,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 307 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:27,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 415 [2025-02-08 05:40:27,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,819 INFO L124 PetriNetUnfolderBase]: 285/977 cut-off events. [2025-02-08 05:40:27,819 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:27,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 977 events. 285/977 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4601 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1400. Up to 426 conditions per place. [2025-02-08 05:40:27,823 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-02-08 05:40:27,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 306 transitions, 673 flow [2025-02-08 05:40:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-02-08 05:40:27,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742971887550201 [2025-02-08 05:40:27,825 INFO L175 Difference]: Start difference. First operand has 310 places, 307 transitions, 627 flow. Second operand 3 states and 964 transitions. [2025-02-08 05:40:27,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 306 transitions, 673 flow [2025-02-08 05:40:27,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 306 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:27,828 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 625 flow [2025-02-08 05:40:27,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2025-02-08 05:40:27,829 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -86 predicate places. [2025-02-08 05:40:27,829 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 625 flow [2025-02-08 05:40:27,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:40:27,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,829 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] [2025-02-08 05:40:27,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:27,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,830 INFO L85 PathProgramCache]: Analyzing trace with hash 76967872, now seen corresponding path program 1 times [2025-02-08 05:40:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881979831] [2025-02-08 05:40:27,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:40:27,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:40:27,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,855 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:40:27,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881979831] [2025-02-08 05:40:27,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881979831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231689980] [2025-02-08 05:40:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:27,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:27,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:27,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 415 [2025-02-08 05:40:27,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:27,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 415 [2025-02-08 05:40:27,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,960 INFO L124 PetriNetUnfolderBase]: 285/976 cut-off events. [2025-02-08 05:40:27,960 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:40:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 976 events. 285/976 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4592 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1397. Up to 423 conditions per place. [2025-02-08 05:40:27,964 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 20 selfloop transitions, 1 changer transitions 0/305 dead transitions. [2025-02-08 05:40:27,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 305 transitions, 665 flow [2025-02-08 05:40:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:40:27,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815261044176707 [2025-02-08 05:40:27,966 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 625 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:40:27,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 305 transitions, 665 flow [2025-02-08 05:40:27,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:27,969 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 621 flow [2025-02-08 05:40:27,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2025-02-08 05:40:27,970 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -87 predicate places. [2025-02-08 05:40:27,970 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 621 flow [2025-02-08 05:40:27,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:27,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:27,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:27,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -221534237, now seen corresponding path program 1 times [2025-02-08 05:40:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530231097] [2025-02-08 05:40:27,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:40:27,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:40:27,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,002 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:40:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530231097] [2025-02-08 05:40:28,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530231097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814438108] [2025-02-08 05:40:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:28,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:28,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:28,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,133 INFO L124 PetriNetUnfolderBase]: 285/975 cut-off events. [2025-02-08 05:40:28,133 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:28,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 975 events. 285/975 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4613 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1396. Up to 425 conditions per place. [2025-02-08 05:40:28,137 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-02-08 05:40:28,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 304 transitions, 665 flow [2025-02-08 05:40:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:40:28,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7759036144578313 [2025-02-08 05:40:28,139 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 621 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:40:28,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 304 transitions, 665 flow [2025-02-08 05:40:28,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 304 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:28,142 INFO L231 Difference]: Finished difference. Result has 308 places, 304 transitions, 622 flow [2025-02-08 05:40:28,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=308, PETRI_TRANSITIONS=304} [2025-02-08 05:40:28,143 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -87 predicate places. [2025-02-08 05:40:28,143 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 304 transitions, 622 flow [2025-02-08 05:40:28,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:28,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:28,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:28,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1639812480, now seen corresponding path program 1 times [2025-02-08 05:40:28,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544252554] [2025-02-08 05:40:28,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:40:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:40:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,173 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:40:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544252554] [2025-02-08 05:40:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544252554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528050728] [2025-02-08 05:40:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:28,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 415 [2025-02-08 05:40:28,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 304 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:28,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 415 [2025-02-08 05:40:28,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,288 INFO L124 PetriNetUnfolderBase]: 285/974 cut-off events. [2025-02-08 05:40:28,288 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:28,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 974 events. 285/974 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4597 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1395. Up to 423 conditions per place. [2025-02-08 05:40:28,293 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 20 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2025-02-08 05:40:28,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 303 transitions, 662 flow [2025-02-08 05:40:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:28,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:40:28,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815261044176707 [2025-02-08 05:40:28,295 INFO L175 Difference]: Start difference. First operand has 308 places, 304 transitions, 622 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:40:28,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 303 transitions, 662 flow [2025-02-08 05:40:28,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 303 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:28,299 INFO L231 Difference]: Finished difference. Result has 307 places, 303 transitions, 618 flow [2025-02-08 05:40:28,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=307, PETRI_TRANSITIONS=303} [2025-02-08 05:40:28,300 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -88 predicate places. [2025-02-08 05:40:28,300 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 303 transitions, 618 flow [2025-02-08 05:40:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:28,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,300 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] [2025-02-08 05:40:28,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:28,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1836186986, now seen corresponding path program 1 times [2025-02-08 05:40:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117996367] [2025-02-08 05:40:28,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:40:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:40:28,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,770 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:40:28,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117996367] [2025-02-08 05:40:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117996367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30122252] [2025-02-08 05:40:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:28,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:28,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 415 [2025-02-08 05:40:28,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 303 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:40:28,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 415 [2025-02-08 05:40:28,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,044 INFO L124 PetriNetUnfolderBase]: 285/971 cut-off events. [2025-02-08 05:40:29,045 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:29,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 971 events. 285/971 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4548 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1428. Up to 446 conditions per place. [2025-02-08 05:40:29,049 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 42 selfloop transitions, 15 changer transitions 0/300 dead transitions. [2025-02-08 05:40:29,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 300 transitions, 726 flow [2025-02-08 05:40:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1734 transitions. [2025-02-08 05:40:29,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6963855421686747 [2025-02-08 05:40:29,052 INFO L175 Difference]: Start difference. First operand has 307 places, 303 transitions, 618 flow. Second operand 6 states and 1734 transitions. [2025-02-08 05:40:29,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 300 transitions, 726 flow [2025-02-08 05:40:29,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 300 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:29,055 INFO L231 Difference]: Finished difference. Result has 308 places, 300 transitions, 641 flow [2025-02-08 05:40:29,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=308, PETRI_TRANSITIONS=300} [2025-02-08 05:40:29,057 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -87 predicate places. [2025-02-08 05:40:29,057 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 300 transitions, 641 flow [2025-02-08 05:40:29,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:40:29,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,058 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] [2025-02-08 05:40:29,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:29,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2056377659, now seen corresponding path program 1 times [2025-02-08 05:40:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946781646] [2025-02-08 05:40:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:40:29,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:40:29,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,094 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:40:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946781646] [2025-02-08 05:40:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946781646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457279622] [2025-02-08 05:40:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:29,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 300 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,236 INFO L124 PetriNetUnfolderBase]: 285/970 cut-off events. [2025-02-08 05:40:29,236 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:29,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 970 events. 285/970 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4586 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1422. Up to 425 conditions per place. [2025-02-08 05:40:29,239 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2025-02-08 05:40:29,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 299 transitions, 685 flow [2025-02-08 05:40:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:40:29,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7759036144578313 [2025-02-08 05:40:29,242 INFO L175 Difference]: Start difference. First operand has 308 places, 300 transitions, 641 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:40:29,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 299 transitions, 685 flow [2025-02-08 05:40:29,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:29,247 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 613 flow [2025-02-08 05:40:29,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=304, PETRI_TRANSITIONS=299} [2025-02-08 05:40:29,248 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -91 predicate places. [2025-02-08 05:40:29,249 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 613 flow [2025-02-08 05:40:29,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:29,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:29,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:29,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2077544320, now seen corresponding path program 1 times [2025-02-08 05:40:29,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660076100] [2025-02-08 05:40:29,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:40:29,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:40:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,282 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:40:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660076100] [2025-02-08 05:40:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660076100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142277815] [2025-02-08 05:40:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 415 [2025-02-08 05:40:29,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 299 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:29,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 415 [2025-02-08 05:40:29,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,397 INFO L124 PetriNetUnfolderBase]: 285/969 cut-off events. [2025-02-08 05:40:29,397 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:29,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 969 events. 285/969 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4592 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1391. Up to 423 conditions per place. [2025-02-08 05:40:29,402 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 20 selfloop transitions, 1 changer transitions 0/298 dead transitions. [2025-02-08 05:40:29,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 298 transitions, 653 flow [2025-02-08 05:40:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:40:29,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815261044176707 [2025-02-08 05:40:29,405 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 613 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:40:29,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 298 transitions, 653 flow [2025-02-08 05:40:29,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 298 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:29,408 INFO L231 Difference]: Finished difference. Result has 303 places, 298 transitions, 609 flow [2025-02-08 05:40:29,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=303, PETRI_TRANSITIONS=298} [2025-02-08 05:40:29,409 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -92 predicate places. [2025-02-08 05:40:29,409 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 298 transitions, 609 flow [2025-02-08 05:40:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:40:29,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:29,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1896687275, now seen corresponding path program 1 times [2025-02-08 05:40:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668785828] [2025-02-08 05:40:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:40:29,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:40:29,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,446 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:40:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668785828] [2025-02-08 05:40:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668785828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727741163] [2025-02-08 05:40:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:29,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 298 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:29,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,597 INFO L124 PetriNetUnfolderBase]: 285/968 cut-off events. [2025-02-08 05:40:29,597 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:29,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 968 events. 285/968 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4578 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1391. Up to 425 conditions per place. [2025-02-08 05:40:29,600 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-02-08 05:40:29,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 297 transitions, 653 flow [2025-02-08 05:40:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:40:29,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7759036144578313 [2025-02-08 05:40:29,603 INFO L175 Difference]: Start difference. First operand has 303 places, 298 transitions, 609 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:40:29,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 297 transitions, 653 flow [2025-02-08 05:40:29,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:29,606 INFO L231 Difference]: Finished difference. Result has 303 places, 297 transitions, 610 flow [2025-02-08 05:40:29,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=303, PETRI_TRANSITIONS=297} [2025-02-08 05:40:29,608 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -92 predicate places. [2025-02-08 05:40:29,608 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 297 transitions, 610 flow [2025-02-08 05:40:29,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:29,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:29,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:29,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1088823402, now seen corresponding path program 1 times [2025-02-08 05:40:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278613861] [2025-02-08 05:40:29,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:40:29,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:40:29,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,660 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:40:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278613861] [2025-02-08 05:40:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278613861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713763089] [2025-02-08 05:40:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:29,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 297 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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:40:29,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:29,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,821 INFO L124 PetriNetUnfolderBase]: 285/966 cut-off events. [2025-02-08 05:40:29,821 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:29,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 966 events. 285/966 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4562 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1391. Up to 425 conditions per place. [2025-02-08 05:40:29,826 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 1 changer transitions 0/295 dead transitions. [2025-02-08 05:40:29,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 652 flow [2025-02-08 05:40:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2025-02-08 05:40:29,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7767068273092369 [2025-02-08 05:40:29,829 INFO L175 Difference]: Start difference. First operand has 303 places, 297 transitions, 610 flow. Second operand 3 states and 967 transitions. [2025-02-08 05:40:29,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 652 flow [2025-02-08 05:40:29,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 295 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:29,833 INFO L231 Difference]: Finished difference. Result has 301 places, 295 transitions, 604 flow [2025-02-08 05:40:29,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=301, PETRI_TRANSITIONS=295} [2025-02-08 05:40:29,834 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -94 predicate places. [2025-02-08 05:40:29,834 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 295 transitions, 604 flow [2025-02-08 05:40:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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:40:29,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:29,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:29,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -149893391, now seen corresponding path program 1 times [2025-02-08 05:40:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721939824] [2025-02-08 05:40:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:40:29,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:40:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,889 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:40:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721939824] [2025-02-08 05:40:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721939824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378066534] [2025-02-08 05:40:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:29,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:29,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 415 [2025-02-08 05:40:29,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 295 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:29,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 415 [2025-02-08 05:40:29,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,019 INFO L124 PetriNetUnfolderBase]: 285/965 cut-off events. [2025-02-08 05:40:30,019 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:30,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 965 events. 285/965 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4568 event pairs, 221 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1389. Up to 425 conditions per place. [2025-02-08 05:40:30,024 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 21 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-02-08 05:40:30,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 294 transitions, 648 flow [2025-02-08 05:40:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:40:30,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7759036144578313 [2025-02-08 05:40:30,027 INFO L175 Difference]: Start difference. First operand has 301 places, 295 transitions, 604 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:40:30,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 294 transitions, 648 flow [2025-02-08 05:40:30,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 294 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:30,030 INFO L231 Difference]: Finished difference. Result has 301 places, 294 transitions, 605 flow [2025-02-08 05:40:30,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=301, PETRI_TRANSITIONS=294} [2025-02-08 05:40:30,031 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -94 predicate places. [2025-02-08 05:40:30,031 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 294 transitions, 605 flow [2025-02-08 05:40:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:40:30,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:30,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:30,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:30,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 150 more)] === [2025-02-08 05:40:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -208975624, now seen corresponding path program 1 times [2025-02-08 05:40:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680494881] [2025-02-08 05:40:30,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:30,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-08 05:40:30,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-08 05:40:30,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:30,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:30,111 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:40:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680494881] [2025-02-08 05:40:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680494881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572179750] [2025-02-08 05:40:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:30,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:30,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 415 [2025-02-08 05:40:30,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 294 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:40:30,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:30,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 415 [2025-02-08 05:40:30,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,243 INFO L124 PetriNetUnfolderBase]: 285/964 cut-off events. [2025-02-08 05:40:30,243 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:40:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 964 events. 285/964 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4540 event pairs, 221 based on Foata normal form. 1/866 useless extension candidates. Maximal degree in co-relation 1387. Up to 422 conditions per place. [2025-02-08 05:40:30,245 INFO L140 encePairwiseOnDemand]: 413/415 looper letters, 0 selfloop transitions, 0 changer transitions 293/293 dead transitions. [2025-02-08 05:40:30,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 641 flow [2025-02-08 05:40:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-02-08 05:40:30,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7823293172690763 [2025-02-08 05:40:30,248 INFO L175 Difference]: Start difference. First operand has 301 places, 294 transitions, 605 flow. Second operand 3 states and 974 transitions. [2025-02-08 05:40:30,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 293 transitions, 641 flow [2025-02-08 05:40:30,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 293 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:30,250 INFO L231 Difference]: Finished difference. Result has 300 places, 0 transitions, 0 flow [2025-02-08 05:40:30,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=300, PETRI_TRANSITIONS=0} [2025-02-08 05:40:30,250 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, -95 predicate places. [2025-02-08 05:40:30,250 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 0 transitions, 0 flow [2025-02-08 05:40:30,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (153 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (152 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (151 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (150 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (148 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (147 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (146 of 154 remaining) [2025-02-08 05:40:30,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (145 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (144 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (142 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (141 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (140 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (139 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (138 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (137 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (135 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (134 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (133 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (132 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (131 of 154 remaining) [2025-02-08 05:40:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (130 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (129 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (128 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (127 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (126 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (125 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (124 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (123 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (122 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (121 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (120 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (119 of 154 remaining) [2025-02-08 05:40:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (118 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (117 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (116 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (115 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (114 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (113 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (112 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (111 of 154 remaining) [2025-02-08 05:40:30,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (110 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (109 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (108 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (107 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (106 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (105 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (104 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (103 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (102 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (101 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (99 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (98 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (97 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (96 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (95 of 154 remaining) [2025-02-08 05:40:30,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (94 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (93 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (92 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (91 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (90 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (89 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (88 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (87 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (86 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (84 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (83 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (82 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 154 remaining) [2025-02-08 05:40:30,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (77 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (76 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (75 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (74 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (73 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (72 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (71 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (70 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (69 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (68 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (67 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (66 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (65 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (64 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (63 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (62 of 154 remaining) [2025-02-08 05:40:30,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (61 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (60 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (57 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (56 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (55 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (54 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (46 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (45 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (44 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (42 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (41 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (39 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 154 remaining) [2025-02-08 05:40:30,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 154 remaining) [2025-02-08 05:40:30,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 154 remaining) [2025-02-08 05:40:30,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 154 remaining) [2025-02-08 05:40:30,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (25 of 154 remaining) [2025-02-08 05:40:30,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (24 of 154 remaining) [2025-02-08 05:40:30,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (23 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (22 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (21 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (20 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (19 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (17 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (16 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (14 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (13 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (12 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (11 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (10 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (9 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (8 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (5 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (4 of 154 remaining) [2025-02-08 05:40:30,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 154 remaining) [2025-02-08 05:40:30,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (2 of 154 remaining) [2025-02-08 05:40:30,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (1 of 154 remaining) [2025-02-08 05:40:30,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 154 remaining) [2025-02-08 05:40:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:30,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:30,269 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:30,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:30,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:30 BasicIcfg [2025-02-08 05:40:30,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:30,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:30,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:30,274 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:30,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:25" (3/4) ... [2025-02-08 05:40:30,276 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:30,277 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:30,278 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:30,278 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:30,278 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:40:30,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 05:40:30,286 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:30,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:40:30,287 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:30,359 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:30,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:30,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:30,361 INFO L158 Benchmark]: Toolchain (without parser) took 6486.19ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 134.1MB in the beginning and 303.9MB in the end (delta: -169.8MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,361 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 119.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.14ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,364 INFO L158 Benchmark]: Boogie Preprocessor took 46.02ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,364 INFO L158 Benchmark]: IcfgBuilder took 1202.28ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 123.5MB in the end (delta: -10.8MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,364 INFO L158 Benchmark]: TraceAbstraction took 4867.53ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 122.6MB in the beginning and 308.1MB in the end (delta: -185.5MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,364 INFO L158 Benchmark]: Witness Printer took 85.66ms. Allocated memory is still 444.6MB. Free memory was 308.1MB in the beginning and 303.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,365 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.59ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 119.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.14ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 115.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.02ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1202.28ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 123.5MB in the end (delta: -10.8MB). Peak memory consumption was 79.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4867.53ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 122.6MB in the beginning and 308.1MB in the end (delta: -185.5MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. * Witness Printer took 85.66ms. Allocated memory is still 444.6MB. Free memory was 308.1MB in the beginning and 303.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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 - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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 9 procedures, 506 locations, 154 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 61 mSDtfsCounter, 866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:30,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE