./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:42,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:42,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:42,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:42,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:42,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:42,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:42,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:42,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:42,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:42,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:42,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:42,778 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:42,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:42,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:42,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:42,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:42,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:42,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:42,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:42,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:42,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:42,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:42,782 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-02-08 05:38:43,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:43,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:43,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:43,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:43,028 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:43,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-08 05:38:44,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f252c7567/59b0f87aa1b347e8afbff24f320709d3/FLAG9b6a1679a [2025-02-08 05:38:44,442 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:44,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-08 05:38:44,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f252c7567/59b0f87aa1b347e8afbff24f320709d3/FLAG9b6a1679a [2025-02-08 05:38:44,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f252c7567/59b0f87aa1b347e8afbff24f320709d3 [2025-02-08 05:38:44,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:44,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:44,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:44,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:44,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:44,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bcc8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44, skipping insertion in model container [2025-02-08 05:38:44,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:44,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:44,642 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:44,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:44,673 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:44,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44 WrapperNode [2025-02-08 05:38:44,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:44,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:44,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:44,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:44,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,710 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 321 [2025-02-08 05:38:44,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:44,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:44,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:44,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:44,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:44,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:44,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:44,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:44,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (1/1) ... [2025-02-08 05:38:44,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:44,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:44,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:44,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:44,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:38:44,803 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:44,896 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:44,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:45,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc main_#t~post23#1; [2025-02-08 05:38:45,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: main_~i~2#1 := 1 + main_#t~post23#1; [2025-02-08 05:38:45,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: main_#t~post23#1 := main_~i~2#1; [2025-02-08 05:38:45,553 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc main_#t~nondet22#1; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-1: assume ((#race[~B~0.base,~B~0.offset + 4 * main_~i~2#1] == main_#t~nondet22#1 && #race[~B~0.base,1 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1) && #race[~B~0.base,2 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1) && #race[~B~0.base,3 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-1: assume !(((#race[~B~0.base,~B~0.offset + 4 * main_~i~2#1] == main_#t~nondet22#1 && #race[~B~0.base,1 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1) && #race[~B~0.base,2 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1) && #race[~B~0.base,3 + (~B~0.offset + 4 * main_~i~2#1)] == main_#t~nondet22#1); [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-2: havoc main_#t~ret21#1.base, main_#t~ret21#1.offset; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-3: #race := #race[~B~0.base,3 + (~B~0.offset + 4 * main_~i~2#1) := main_#t~nondet22#1]; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-4: #race := #race[~B~0.base,2 + (~B~0.offset + 4 * main_~i~2#1) := main_#t~nondet22#1]; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-5: #race := #race[~B~0.base,1 + (~B~0.offset + 4 * main_~i~2#1) := main_#t~nondet22#1]; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-6: #race := #race[~B~0.base,~B~0.offset + 4 * main_~i~2#1 := main_#t~nondet22#1]; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-7: havoc main_#t~nondet22#1; [2025-02-08 05:38:45,554 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-8: SUMMARY for call write~$Pointer$(main_#t~ret21#1.base, main_#t~ret21#1.offset, ~B~0.base, ~B~0.offset + 4 * main_~i~2#1, 4); srcloc: null [2025-02-08 05:38:45,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-9: havoc create_fresh_int_array_#in~size#1;assume { :end_inline_create_fresh_int_array } true; [2025-02-08 05:38:45,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-10: havoc create_fresh_int_array_#t~malloc38#1.base, create_fresh_int_array_#t~malloc38#1.offset, create_fresh_int_array_#t~nondet39#1, create_fresh_int_array_#t~nondet40#1, create_fresh_int_array_#t~post41#1, create_fresh_int_array_~i~3#1, create_fresh_int_array_~size#1, create_fresh_int_array_~arr~0#1.base, create_fresh_int_array_~arr~0#1.offset; [2025-02-08 05:38:45,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L81-11: main_#t~ret21#1.base, main_#t~ret21#1.offset := create_fresh_int_array_#res#1.base, create_fresh_int_array_#res#1.offset; [2025-02-08 05:38:45,556 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:45,556 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:45,577 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:45,578 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:45,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:45 BoogieIcfgContainer [2025-02-08 05:38:45,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:45,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:45,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:45,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:45,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:44" (1/3) ... [2025-02-08 05:38:45,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f07b50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:45, skipping insertion in model container [2025-02-08 05:38:45,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:44" (2/3) ... [2025-02-08 05:38:45,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f07b50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:45, skipping insertion in model container [2025-02-08 05:38:45,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:45" (3/3) ... [2025-02-08 05:38:45,588 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-02-08 05:38:45,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:45,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 490 locations, 1 initial locations, 7 loop locations, and 55 error locations. [2025-02-08 05:38:45,599 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:45,697 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:38:45,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 496 places, 515 transitions, 1044 flow [2025-02-08 05:38:45,867 INFO L124 PetriNetUnfolderBase]: 26/513 cut-off events. [2025-02-08 05:38:45,869 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:45,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 513 events. 26/513 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 800 event pairs, 0 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 331. Up to 2 conditions per place. [2025-02-08 05:38:45,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 496 places, 515 transitions, 1044 flow [2025-02-08 05:38:45,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 490 transitions, 992 flow [2025-02-08 05:38:45,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:45,902 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;@2690c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:45,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:38:45,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:45,906 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:38:45,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:45,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,907 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] [2025-02-08 05:38:45,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1324272779, now seen corresponding path program 1 times [2025-02-08 05:38:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680058763] [2025-02-08 05:38:45,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:38:45,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:38:45,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680058763] [2025-02-08 05:38:46,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680058763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638617606] [2025-02-08 05:38:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-02-08 05:38:46,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 490 transitions, 992 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-02-08 05:38:46,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,257 INFO L124 PetriNetUnfolderBase]: 12/478 cut-off events. [2025-02-08 05:38:46,257 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:38:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 478 events. 12/478 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 2 based on Foata normal form. 18/422 useless extension candidates. Maximal degree in co-relation 325. Up to 20 conditions per place. [2025-02-08 05:38:46,261 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 15 selfloop transitions, 2 changer transitions 11/474 dead transitions. [2025-02-08 05:38:46,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 474 transitions, 994 flow [2025-02-08 05:38:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1470 transitions. [2025-02-08 05:38:46,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-02-08 05:38:46,280 INFO L175 Difference]: Start difference. First operand has 472 places, 490 transitions, 992 flow. Second operand 3 states and 1470 transitions. [2025-02-08 05:38:46,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 474 transitions, 994 flow [2025-02-08 05:38:46,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 474 transitions, 986 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:46,295 INFO L231 Difference]: Finished difference. Result has 469 places, 463 transitions, 934 flow [2025-02-08 05:38:46,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=469, PETRI_TRANSITIONS=463} [2025-02-08 05:38:46,302 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -3 predicate places. [2025-02-08 05:38:46,302 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 463 transitions, 934 flow [2025-02-08 05:38:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,303 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] [2025-02-08 05:38:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:46,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1754303193, now seen corresponding path program 1 times [2025-02-08 05:38:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389766036] [2025-02-08 05:38:46,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:38:46,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:38:46,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389766036] [2025-02-08 05:38:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389766036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672150139] [2025-02-08 05:38:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 515 [2025-02-08 05:38:46,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 463 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 515 [2025-02-08 05:38:46,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,465 INFO L124 PetriNetUnfolderBase]: 17/514 cut-off events. [2025-02-08 05:38:46,465 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:38:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 514 events. 17/514 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1026 event pairs, 4 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 520. Up to 30 conditions per place. [2025-02-08 05:38:46,468 INFO L140 encePairwiseOnDemand]: 506/515 looper letters, 20 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2025-02-08 05:38:46,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 455 transitions, 960 flow [2025-02-08 05:38:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1436 transitions. [2025-02-08 05:38:46,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294498381877022 [2025-02-08 05:38:46,472 INFO L175 Difference]: Start difference. First operand has 469 places, 463 transitions, 934 flow. Second operand 3 states and 1436 transitions. [2025-02-08 05:38:46,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 455 transitions, 960 flow [2025-02-08 05:38:46,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 455 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,481 INFO L231 Difference]: Finished difference. Result has 450 places, 455 transitions, 916 flow [2025-02-08 05:38:46,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=450, PETRI_TRANSITIONS=455} [2025-02-08 05:38:46,483 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2025-02-08 05:38:46,483 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 455 transitions, 916 flow [2025-02-08 05:38:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:46,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:46,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1025694862, now seen corresponding path program 1 times [2025-02-08 05:38:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288290899] [2025-02-08 05:38:46,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:38:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:38:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288290899] [2025-02-08 05:38:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288290899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002613831] [2025-02-08 05:38:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 515 [2025-02-08 05:38:46,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 455 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 515 [2025-02-08 05:38:46,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,672 INFO L124 PetriNetUnfolderBase]: 13/509 cut-off events. [2025-02-08 05:38:46,672 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:46,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 509 events. 13/509 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 942 event pairs, 1 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 504. Up to 20 conditions per place. [2025-02-08 05:38:46,674 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 16 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-02-08 05:38:46,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 454 transitions, 950 flow [2025-02-08 05:38:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1453 transitions. [2025-02-08 05:38:46,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940453074433657 [2025-02-08 05:38:46,678 INFO L175 Difference]: Start difference. First operand has 450 places, 455 transitions, 916 flow. Second operand 3 states and 1453 transitions. [2025-02-08 05:38:46,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 454 transitions, 950 flow [2025-02-08 05:38:46,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 454 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:46,686 INFO L231 Difference]: Finished difference. Result has 450 places, 454 transitions, 917 flow [2025-02-08 05:38:46,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=450, PETRI_TRANSITIONS=454} [2025-02-08 05:38:46,687 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2025-02-08 05:38:46,687 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 454 transitions, 917 flow [2025-02-08 05:38:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,688 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] [2025-02-08 05:38:46,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:46,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:46,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 23674859, now seen corresponding path program 1 times [2025-02-08 05:38:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421841048] [2025-02-08 05:38:46,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:38:46,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:38:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421841048] [2025-02-08 05:38:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421841048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199937253] [2025-02-08 05:38:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 466 out of 515 [2025-02-08 05:38:46,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 454 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 466 of 515 [2025-02-08 05:38:46,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,845 INFO L124 PetriNetUnfolderBase]: 14/500 cut-off events. [2025-02-08 05:38:46,846 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:38:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 500 events. 14/500 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 933 event pairs, 2 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 505. Up to 27 conditions per place. [2025-02-08 05:38:46,848 INFO L140 encePairwiseOnDemand]: 505/515 looper letters, 22 selfloop transitions, 1 changer transitions 0/445 dead transitions. [2025-02-08 05:38:46,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 445 transitions, 945 flow [2025-02-08 05:38:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2025-02-08 05:38:46,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9255663430420712 [2025-02-08 05:38:46,851 INFO L175 Difference]: Start difference. First operand has 450 places, 454 transitions, 917 flow. Second operand 3 states and 1430 transitions. [2025-02-08 05:38:46,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 445 transitions, 945 flow [2025-02-08 05:38:46,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 445 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,858 INFO L231 Difference]: Finished difference. Result has 441 places, 445 transitions, 897 flow [2025-02-08 05:38:46,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=445} [2025-02-08 05:38:46,859 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2025-02-08 05:38:46,859 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 445 transitions, 897 flow [2025-02-08 05:38:46,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:46,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:46,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1053576048, now seen corresponding path program 1 times [2025-02-08 05:38:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990624497] [2025-02-08 05:38:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:46,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:46,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990624497] [2025-02-08 05:38:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990624497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334679525] [2025-02-08 05:38:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 515 [2025-02-08 05:38:46,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 445 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 515 [2025-02-08 05:38:46,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,013 INFO L124 PetriNetUnfolderBase]: 12/480 cut-off events. [2025-02-08 05:38:47,014 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:47,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 480 events. 12/480 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 833 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 471. Up to 14 conditions per place. [2025-02-08 05:38:47,017 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-02-08 05:38:47,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 444 transitions, 919 flow [2025-02-08 05:38:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:38:47,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948220064724919 [2025-02-08 05:38:47,021 INFO L175 Difference]: Start difference. First operand has 441 places, 445 transitions, 897 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:38:47,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 444 transitions, 919 flow [2025-02-08 05:38:47,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 444 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:47,031 INFO L231 Difference]: Finished difference. Result has 441 places, 444 transitions, 898 flow [2025-02-08 05:38:47,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=441, PETRI_TRANSITIONS=444} [2025-02-08 05:38:47,032 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2025-02-08 05:38:47,032 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 444 transitions, 898 flow [2025-02-08 05:38:47,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:47,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,033 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] [2025-02-08 05:38:47,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:47,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:47,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash -536293065, now seen corresponding path program 1 times [2025-02-08 05:38:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208275579] [2025-02-08 05:38:47,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:38:47,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:38:47,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208275579] [2025-02-08 05:38:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208275579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911440660] [2025-02-08 05:38:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 515 [2025-02-08 05:38:47,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:47,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 515 [2025-02-08 05:38:47,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,138 INFO L124 PetriNetUnfolderBase]: 13/477 cut-off events. [2025-02-08 05:38:47,138 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:47,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 477 events. 13/477 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 821 event pairs, 2 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 473. Up to 15 conditions per place. [2025-02-08 05:38:47,141 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 10 selfloop transitions, 1 changer transitions 0/441 dead transitions. [2025-02-08 05:38:47,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 441 transitions, 914 flow [2025-02-08 05:38:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1466 transitions. [2025-02-08 05:38:47,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488673139158577 [2025-02-08 05:38:47,144 INFO L175 Difference]: Start difference. First operand has 441 places, 444 transitions, 898 flow. Second operand 3 states and 1466 transitions. [2025-02-08 05:38:47,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 441 transitions, 914 flow [2025-02-08 05:38:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 441 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:47,151 INFO L231 Difference]: Finished difference. Result has 438 places, 441 transitions, 890 flow [2025-02-08 05:38:47,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=438, PETRI_TRANSITIONS=441} [2025-02-08 05:38:47,152 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -34 predicate places. [2025-02-08 05:38:47,152 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 441 transitions, 890 flow [2025-02-08 05:38:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:47,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,153 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] [2025-02-08 05:38:47,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:47,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:47,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1746811714, now seen corresponding path program 1 times [2025-02-08 05:38:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373259005] [2025-02-08 05:38:47,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:47,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373259005] [2025-02-08 05:38:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373259005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896954412] [2025-02-08 05:38:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:47,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:48,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 515 [2025-02-08 05:38:48,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 441 transitions, 890 flow. Second operand has 6 states, 6 states have (on average 422.5) internal successors, (2535), 6 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 515 [2025-02-08 05:38:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,192 INFO L124 PetriNetUnfolderBase]: 171/1140 cut-off events. [2025-02-08 05:38:48,192 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:38:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1140 events. 171/1140 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5552 event pairs, 116 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1465. Up to 326 conditions per place. [2025-02-08 05:38:48,196 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 52 selfloop transitions, 10 changer transitions 38/438 dead transitions. [2025-02-08 05:38:48,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 1030 flow [2025-02-08 05:38:48,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2602 transitions. [2025-02-08 05:38:48,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8420711974110032 [2025-02-08 05:38:48,200 INFO L175 Difference]: Start difference. First operand has 438 places, 441 transitions, 890 flow. Second operand 6 states and 2602 transitions. [2025-02-08 05:38:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 1030 flow [2025-02-08 05:38:48,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 438 transitions, 1029 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:48,204 INFO L231 Difference]: Finished difference. Result has 439 places, 400 transitions, 827 flow [2025-02-08 05:38:48,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=439, PETRI_TRANSITIONS=400} [2025-02-08 05:38:48,205 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -33 predicate places. [2025-02-08 05:38:48,205 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 400 transitions, 827 flow [2025-02-08 05:38:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 422.5) internal successors, (2535), 6 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:48,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2008863682, now seen corresponding path program 1 times [2025-02-08 05:38:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765350591] [2025-02-08 05:38:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:48,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:48,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765350591] [2025-02-08 05:38:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765350591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786010487] [2025-02-08 05:38:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 515 [2025-02-08 05:38:48,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 400 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 515 [2025-02-08 05:38:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,296 INFO L124 PetriNetUnfolderBase]: 12/457 cut-off events. [2025-02-08 05:38:48,296 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:38:48,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 457 events. 12/457 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 719 event pairs, 1 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 457. Up to 12 conditions per place. [2025-02-08 05:38:48,298 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 9 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2025-02-08 05:38:48,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 399 transitions, 847 flow [2025-02-08 05:38:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1467 transitions. [2025-02-08 05:38:48,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495145631067962 [2025-02-08 05:38:48,301 INFO L175 Difference]: Start difference. First operand has 439 places, 400 transitions, 827 flow. Second operand 3 states and 1467 transitions. [2025-02-08 05:38:48,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 399 transitions, 847 flow [2025-02-08 05:38:48,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 399 transitions, 827 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:48,306 INFO L231 Difference]: Finished difference. Result has 398 places, 399 transitions, 809 flow [2025-02-08 05:38:48,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=398, PETRI_TRANSITIONS=399} [2025-02-08 05:38:48,308 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -74 predicate places. [2025-02-08 05:38:48,309 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 399 transitions, 809 flow [2025-02-08 05:38:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,310 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] [2025-02-08 05:38:48,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:48,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1989510960, now seen corresponding path program 1 times [2025-02-08 05:38:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125371056] [2025-02-08 05:38:48,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:38:48,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:38:48,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125371056] [2025-02-08 05:38:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125371056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131382876] [2025-02-08 05:38:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 515 [2025-02-08 05:38:48,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 399 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 515 [2025-02-08 05:38:48,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,410 INFO L124 PetriNetUnfolderBase]: 14/459 cut-off events. [2025-02-08 05:38:48,410 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:48,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 459 events. 14/459 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 777 event pairs, 3 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 455. Up to 16 conditions per place. [2025-02-08 05:38:48,412 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 9 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2025-02-08 05:38:48,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 398 transitions, 829 flow [2025-02-08 05:38:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1467 transitions. [2025-02-08 05:38:48,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495145631067962 [2025-02-08 05:38:48,415 INFO L175 Difference]: Start difference. First operand has 398 places, 399 transitions, 809 flow. Second operand 3 states and 1467 transitions. [2025-02-08 05:38:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 398 transitions, 829 flow [2025-02-08 05:38:48,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 398 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,419 INFO L231 Difference]: Finished difference. Result has 397 places, 398 transitions, 807 flow [2025-02-08 05:38:48,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=397, PETRI_TRANSITIONS=398} [2025-02-08 05:38:48,420 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -75 predicate places. [2025-02-08 05:38:48,420 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 398 transitions, 807 flow [2025-02-08 05:38:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,422 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] [2025-02-08 05:38:48,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:48,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 327456046, now seen corresponding path program 1 times [2025-02-08 05:38:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925247420] [2025-02-08 05:38:48,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:38:48,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:38:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925247420] [2025-02-08 05:38:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925247420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133687826] [2025-02-08 05:38:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 515 [2025-02-08 05:38:48,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 398 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 515 [2025-02-08 05:38:48,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,534 INFO L124 PetriNetUnfolderBase]: 10/399 cut-off events. [2025-02-08 05:38:48,535 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 399 events. 10/399 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 1 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 391. Up to 13 conditions per place. [2025-02-08 05:38:48,536 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-02-08 05:38:48,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 397 transitions, 829 flow [2025-02-08 05:38:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2025-02-08 05:38:48,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.948220064724919 [2025-02-08 05:38:48,539 INFO L175 Difference]: Start difference. First operand has 397 places, 398 transitions, 807 flow. Second operand 3 states and 1465 transitions. [2025-02-08 05:38:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 397 transitions, 829 flow [2025-02-08 05:38:48,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 397 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,544 INFO L231 Difference]: Finished difference. Result has 396 places, 397 transitions, 805 flow [2025-02-08 05:38:48,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=396, PETRI_TRANSITIONS=397} [2025-02-08 05:38:48,545 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -76 predicate places. [2025-02-08 05:38:48,545 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 397 transitions, 805 flow [2025-02-08 05:38:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.3333333333333) internal successors, (1456), 3 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,546 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] [2025-02-08 05:38:48,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:48,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2108806894, now seen corresponding path program 1 times [2025-02-08 05:38:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515454662] [2025-02-08 05:38:48,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:38:48,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:38:48,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515454662] [2025-02-08 05:38:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515454662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304588654] [2025-02-08 05:38:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:38:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:38:48,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:38:48,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 515 [2025-02-08 05:38:48,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 397 transitions, 805 flow. Second operand has 5 states, 5 states have (on average 483.6) internal successors, (2418), 5 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 515 [2025-02-08 05:38:48,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,811 INFO L124 PetriNetUnfolderBase]: 16/731 cut-off events. [2025-02-08 05:38:48,812 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:48,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 731 events. 16/731 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1817 event pairs, 0 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 735. Up to 11 conditions per place. [2025-02-08 05:38:48,815 INFO L140 encePairwiseOnDemand]: 507/515 looper letters, 15 selfloop transitions, 7 changer transitions 0/404 dead transitions. [2025-02-08 05:38:48,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 404 transitions, 867 flow [2025-02-08 05:38:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:38:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:38:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2433 transitions. [2025-02-08 05:38:48,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448543689320388 [2025-02-08 05:38:48,820 INFO L175 Difference]: Start difference. First operand has 396 places, 397 transitions, 805 flow. Second operand 5 states and 2433 transitions. [2025-02-08 05:38:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 404 transitions, 867 flow [2025-02-08 05:38:48,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 404 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,827 INFO L231 Difference]: Finished difference. Result has 400 places, 399 transitions, 832 flow [2025-02-08 05:38:48,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=832, PETRI_PLACES=400, PETRI_TRANSITIONS=399} [2025-02-08 05:38:48,828 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -72 predicate places. [2025-02-08 05:38:48,828 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 399 transitions, 832 flow [2025-02-08 05:38:48,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 483.6) internal successors, (2418), 5 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,830 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] [2025-02-08 05:38:48,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:48,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash 67866714, now seen corresponding path program 1 times [2025-02-08 05:38:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686491526] [2025-02-08 05:38:48,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:38:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:38:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686491526] [2025-02-08 05:38:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686491526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:48,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:48,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896190041] [2025-02-08 05:38:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:48,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:48,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:48,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 484 out of 515 [2025-02-08 05:38:48,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 399 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:48,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 484 of 515 [2025-02-08 05:38:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:48,981 INFO L124 PetriNetUnfolderBase]: 34/1018 cut-off events. [2025-02-08 05:38:48,981 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:38:48,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 1018 events. 34/1018 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3351 event pairs, 0 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 1045. Up to 25 conditions per place. [2025-02-08 05:38:48,986 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 11 selfloop transitions, 2 changer transitions 2/400 dead transitions. [2025-02-08 05:38:48,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 400 transitions, 864 flow [2025-02-08 05:38:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1469 transitions. [2025-02-08 05:38:48,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508090614886732 [2025-02-08 05:38:48,988 INFO L175 Difference]: Start difference. First operand has 400 places, 399 transitions, 832 flow. Second operand 3 states and 1469 transitions. [2025-02-08 05:38:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 400 transitions, 864 flow [2025-02-08 05:38:48,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 400 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:48,993 INFO L231 Difference]: Finished difference. Result has 398 places, 396 transitions, 827 flow [2025-02-08 05:38:48,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=398, PETRI_TRANSITIONS=396} [2025-02-08 05:38:48,995 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -74 predicate places. [2025-02-08 05:38:48,995 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 396 transitions, 827 flow [2025-02-08 05:38:48,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:48,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:48,997 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] [2025-02-08 05:38:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:48,997 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:48,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1528066846, now seen corresponding path program 1 times [2025-02-08 05:38:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234127544] [2025-02-08 05:38:48,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:38:49,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:38:49,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234127544] [2025-02-08 05:38:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234127544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8645928] [2025-02-08 05:38:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:49,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:49,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 487 out of 515 [2025-02-08 05:38:49,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 396 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:49,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 487 of 515 [2025-02-08 05:38:49,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,190 INFO L124 PetriNetUnfolderBase]: 48/1218 cut-off events. [2025-02-08 05:38:49,190 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2025-02-08 05:38:49,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1218 events. 48/1218 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4743 event pairs, 0 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1268. Up to 34 conditions per place. [2025-02-08 05:38:49,193 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 12 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2025-02-08 05:38:49,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 399 transitions, 864 flow [2025-02-08 05:38:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1477 transitions. [2025-02-08 05:38:49,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559870550161812 [2025-02-08 05:38:49,195 INFO L175 Difference]: Start difference. First operand has 398 places, 396 transitions, 827 flow. Second operand 3 states and 1477 transitions. [2025-02-08 05:38:49,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 399 transitions, 864 flow [2025-02-08 05:38:49,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 399 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:49,199 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 837 flow [2025-02-08 05:38:49,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-02-08 05:38:49,200 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -75 predicate places. [2025-02-08 05:38:49,200 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 837 flow [2025-02-08 05:38:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:49,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,201 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] [2025-02-08 05:38:49,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:49,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -406543361, now seen corresponding path program 1 times [2025-02-08 05:38:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574558333] [2025-02-08 05:38:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:38:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:38:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574558333] [2025-02-08 05:38:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574558333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560482061] [2025-02-08 05:38:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:49,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:49,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 487 out of 515 [2025-02-08 05:38:49,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:49,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 487 of 515 [2025-02-08 05:38:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:49,419 INFO L124 PetriNetUnfolderBase]: 82/1794 cut-off events. [2025-02-08 05:38:49,419 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:38:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1794 events. 82/1794 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 9648 event pairs, 8 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 1916. Up to 74 conditions per place. [2025-02-08 05:38:49,425 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 12 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2025-02-08 05:38:49,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 399 transitions, 874 flow [2025-02-08 05:38:49,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1477 transitions. [2025-02-08 05:38:49,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559870550161812 [2025-02-08 05:38:49,428 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 837 flow. Second operand 3 states and 1477 transitions. [2025-02-08 05:38:49,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 399 transitions, 874 flow [2025-02-08 05:38:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 399 transitions, 874 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:49,433 INFO L231 Difference]: Finished difference. Result has 398 places, 396 transitions, 847 flow [2025-02-08 05:38:49,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=398, PETRI_TRANSITIONS=396} [2025-02-08 05:38:49,433 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -74 predicate places. [2025-02-08 05:38:49,434 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 396 transitions, 847 flow [2025-02-08 05:38:49,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:49,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:49,435 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:38:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:49,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1712875266, now seen corresponding path program 1 times [2025-02-08 05:38:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63135329] [2025-02-08 05:38:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-08 05:38:49,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-08 05:38:49,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:49,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63135329] [2025-02-08 05:38:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63135329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:49,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:49,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:38:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761302793] [2025-02-08 05:38:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:49,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:38:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:49,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:38:49,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:38:49,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 515 [2025-02-08 05:38:49,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 396 transitions, 847 flow. Second operand has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:49,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:49,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 515 [2025-02-08 05:38:49,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:50,237 INFO L124 PetriNetUnfolderBase]: 88/2254 cut-off events. [2025-02-08 05:38:50,237 INFO L125 PetriNetUnfolderBase]: For 16/36 co-relation queries the response was YES. [2025-02-08 05:38:50,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 2254 events. 88/2254 cut-off events. For 16/36 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12247 event pairs, 14 based on Foata normal form. 6/2048 useless extension candidates. Maximal degree in co-relation 2520. Up to 67 conditions per place. [2025-02-08 05:38:50,245 INFO L140 encePairwiseOnDemand]: 494/515 looper letters, 26 selfloop transitions, 28 changer transitions 0/422 dead transitions. [2025-02-08 05:38:50,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 422 transitions, 1012 flow [2025-02-08 05:38:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:38:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:38:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4685 transitions. [2025-02-08 05:38:50,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097087378640777 [2025-02-08 05:38:50,253 INFO L175 Difference]: Start difference. First operand has 398 places, 396 transitions, 847 flow. Second operand 10 states and 4685 transitions. [2025-02-08 05:38:50,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 422 transitions, 1012 flow [2025-02-08 05:38:50,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 422 transitions, 1012 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:50,259 INFO L231 Difference]: Finished difference. Result has 411 places, 412 transitions, 976 flow [2025-02-08 05:38:50,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=976, PETRI_PLACES=411, PETRI_TRANSITIONS=412} [2025-02-08 05:38:50,260 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -61 predicate places. [2025-02-08 05:38:50,260 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 412 transitions, 976 flow [2025-02-08 05:38:50,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 466.0) internal successors, (3262), 7 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:50,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:50,262 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] [2025-02-08 05:38:50,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:50,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:50,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -674918464, now seen corresponding path program 1 times [2025-02-08 05:38:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:50,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518788053] [2025-02-08 05:38:50,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:50,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 05:38:50,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 05:38:50,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:50,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518788053] [2025-02-08 05:38:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518788053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225012345] [2025-02-08 05:38:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:38:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:38:50,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:38:50,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-08 05:38:50,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 412 transitions, 976 flow. Second operand has 5 states, 5 states have (on average 483.0) internal successors, (2415), 5 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:50,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:50,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-08 05:38:50,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:50,678 INFO L124 PetriNetUnfolderBase]: 85/1972 cut-off events. [2025-02-08 05:38:50,678 INFO L125 PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES. [2025-02-08 05:38:50,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 1972 events. 85/1972 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10312 event pairs, 24 based on Foata normal form. 5/1810 useless extension candidates. Maximal degree in co-relation 2258. Up to 74 conditions per place. [2025-02-08 05:38:50,686 INFO L140 encePairwiseOnDemand]: 507/515 looper letters, 17 selfloop transitions, 7 changer transitions 0/420 dead transitions. [2025-02-08 05:38:50,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 420 transitions, 1045 flow [2025-02-08 05:38:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:38:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:38:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2430 transitions. [2025-02-08 05:38:50,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436893203883495 [2025-02-08 05:38:50,690 INFO L175 Difference]: Start difference. First operand has 411 places, 412 transitions, 976 flow. Second operand 5 states and 2430 transitions. [2025-02-08 05:38:50,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 420 transitions, 1045 flow [2025-02-08 05:38:50,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 420 transitions, 1045 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:50,696 INFO L231 Difference]: Finished difference. Result has 417 places, 414 transitions, 1007 flow [2025-02-08 05:38:50,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1007, PETRI_PLACES=417, PETRI_TRANSITIONS=414} [2025-02-08 05:38:50,697 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -55 predicate places. [2025-02-08 05:38:50,697 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 414 transitions, 1007 flow [2025-02-08 05:38:50,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 483.0) internal successors, (2415), 5 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:50,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:50,698 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] [2025-02-08 05:38:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:50,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:50,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 869068040, now seen corresponding path program 1 times [2025-02-08 05:38:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266950858] [2025-02-08 05:38:50,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:50,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:38:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:38:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:50,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266950858] [2025-02-08 05:38:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266950858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137502075] [2025-02-08 05:38:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:38:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:50,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:38:50,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:38:50,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 515 [2025-02-08 05:38:50,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 414 transitions, 1007 flow. Second operand has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:50,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:50,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 515 [2025-02-08 05:38:50,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,049 INFO L124 PetriNetUnfolderBase]: 42/1394 cut-off events. [2025-02-08 05:38:51,049 INFO L125 PetriNetUnfolderBase]: For 104/106 co-relation queries the response was YES. [2025-02-08 05:38:51,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 1394 events. 42/1394 cut-off events. For 104/106 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5656 event pairs, 6 based on Foata normal form. 5/1303 useless extension candidates. Maximal degree in co-relation 1636. Up to 42 conditions per place. [2025-02-08 05:38:51,053 INFO L140 encePairwiseOnDemand]: 507/515 looper letters, 6 selfloop transitions, 11 changer transitions 0/368 dead transitions. [2025-02-08 05:38:51,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 368 transitions, 936 flow [2025-02-08 05:38:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2912 transitions. [2025-02-08 05:38:51,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-02-08 05:38:51,058 INFO L175 Difference]: Start difference. First operand has 417 places, 414 transitions, 1007 flow. Second operand 6 states and 2912 transitions. [2025-02-08 05:38:51,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 368 transitions, 936 flow [2025-02-08 05:38:51,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 368 transitions, 928 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:38:51,063 INFO L231 Difference]: Finished difference. Result has 377 places, 367 transitions, 913 flow [2025-02-08 05:38:51,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=913, PETRI_PLACES=377, PETRI_TRANSITIONS=367} [2025-02-08 05:38:51,064 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -95 predicate places. [2025-02-08 05:38:51,064 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 367 transitions, 913 flow [2025-02-08 05:38:51,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:51,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:38:51,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 888473779, now seen corresponding path program 1 times [2025-02-08 05:38:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954758842] [2025-02-08 05:38:51,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:38:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:38:51,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954758842] [2025-02-08 05:38:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954758842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209107455] [2025-02-08 05:38:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:51,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 515 [2025-02-08 05:38:51,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 367 transitions, 913 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 515 [2025-02-08 05:38:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,261 INFO L124 PetriNetUnfolderBase]: 30/1334 cut-off events. [2025-02-08 05:38:51,261 INFO L125 PetriNetUnfolderBase]: For 54/56 co-relation queries the response was YES. [2025-02-08 05:38:51,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1334 events. 30/1334 cut-off events. For 54/56 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 5147 event pairs, 0 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1579. Up to 58 conditions per place. [2025-02-08 05:38:51,265 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2025-02-08 05:38:51,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 366 transitions, 937 flow [2025-02-08 05:38:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-02-08 05:38:51,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-02-08 05:38:51,268 INFO L175 Difference]: Start difference. First operand has 377 places, 367 transitions, 913 flow. Second operand 3 states and 1463 transitions. [2025-02-08 05:38:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 366 transitions, 937 flow [2025-02-08 05:38:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 366 transitions, 915 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:51,273 INFO L231 Difference]: Finished difference. Result has 373 places, 366 transitions, 893 flow [2025-02-08 05:38:51,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=373, PETRI_TRANSITIONS=366} [2025-02-08 05:38:51,274 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -99 predicate places. [2025-02-08 05:38:51,274 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 366 transitions, 893 flow [2025-02-08 05:38:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,275 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] [2025-02-08 05:38:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:38:51,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:51,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1914703800, now seen corresponding path program 1 times [2025-02-08 05:38:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940452717] [2025-02-08 05:38:51,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:38:51,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:38:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940452717] [2025-02-08 05:38:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940452717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679707386] [2025-02-08 05:38:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:51,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:51,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 483 out of 515 [2025-02-08 05:38:51,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 366 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 483 of 515 [2025-02-08 05:38:51,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,451 INFO L124 PetriNetUnfolderBase]: 30/1328 cut-off events. [2025-02-08 05:38:51,452 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:38:51,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 1328 events. 30/1328 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 5103 event pairs, 0 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1564. Up to 58 conditions per place. [2025-02-08 05:38:51,456 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2025-02-08 05:38:51,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 365 transitions, 917 flow [2025-02-08 05:38:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-02-08 05:38:51,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-02-08 05:38:51,458 INFO L175 Difference]: Start difference. First operand has 373 places, 366 transitions, 893 flow. Second operand 3 states and 1463 transitions. [2025-02-08 05:38:51,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 365 transitions, 917 flow [2025-02-08 05:38:51,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 365 transitions, 913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:51,463 INFO L231 Difference]: Finished difference. Result has 372 places, 365 transitions, 891 flow [2025-02-08 05:38:51,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=372, PETRI_TRANSITIONS=365} [2025-02-08 05:38:51,464 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -100 predicate places. [2025-02-08 05:38:51,464 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 365 transitions, 891 flow [2025-02-08 05:38:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 485.6666666666667) internal successors, (1457), 3 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,465 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] [2025-02-08 05:38:51,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:38:51,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1984524671, now seen corresponding path program 1 times [2025-02-08 05:38:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062878830] [2025-02-08 05:38:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:38:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:38:51,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062878830] [2025-02-08 05:38:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062878830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769712522] [2025-02-08 05:38:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:51,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:51,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:51,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:51,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-08 05:38:51,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 365 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:51,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-08 05:38:51,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:51,645 INFO L124 PetriNetUnfolderBase]: 30/1304 cut-off events. [2025-02-08 05:38:51,645 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:38:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 1304 events. 30/1304 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4930 event pairs, 0 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 1546. Up to 48 conditions per place. [2025-02-08 05:38:51,649 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 12 selfloop transitions, 1 changer transitions 0/361 dead transitions. [2025-02-08 05:38:51,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 909 flow [2025-02-08 05:38:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-02-08 05:38:51,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-02-08 05:38:51,652 INFO L175 Difference]: Start difference. First operand has 372 places, 365 transitions, 891 flow. Second operand 3 states and 1460 transitions. [2025-02-08 05:38:51,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 909 flow [2025-02-08 05:38:51,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 361 transitions, 905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:51,656 INFO L231 Difference]: Finished difference. Result has 368 places, 361 transitions, 881 flow [2025-02-08 05:38:51,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=368, PETRI_TRANSITIONS=361} [2025-02-08 05:38:51,657 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -104 predicate places. [2025-02-08 05:38:51,657 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 361 transitions, 881 flow [2025-02-08 05:38:51,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:51,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:51,658 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] [2025-02-08 05:38:51,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:38:51,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2065645162, now seen corresponding path program 1 times [2025-02-08 05:38:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138418456] [2025-02-08 05:38:51,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-08 05:38:51,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-08 05:38:51,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:51,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138418456] [2025-02-08 05:38:52,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138418456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:52,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:52,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193837660] [2025-02-08 05:38:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:52,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:52,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:52,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:52,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:52,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 515 [2025-02-08 05:38:52,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 361 transitions, 881 flow. Second operand has 6 states, 6 states have (on average 465.8333333333333) internal successors, (2795), 6 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:52,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:52,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 515 [2025-02-08 05:38:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:52,575 INFO L124 PetriNetUnfolderBase]: 62/1428 cut-off events. [2025-02-08 05:38:52,575 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:38:52,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 1428 events. 62/1428 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5937 event pairs, 20 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 1812. Up to 134 conditions per place. [2025-02-08 05:38:52,580 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 27 selfloop transitions, 5 changer transitions 0/364 dead transitions. [2025-02-08 05:38:52,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 364 transitions, 955 flow [2025-02-08 05:38:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2809 transitions. [2025-02-08 05:38:52,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090614886731392 [2025-02-08 05:38:52,584 INFO L175 Difference]: Start difference. First operand has 368 places, 361 transitions, 881 flow. Second operand 6 states and 2809 transitions. [2025-02-08 05:38:52,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 364 transitions, 955 flow [2025-02-08 05:38:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 364 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:52,590 INFO L231 Difference]: Finished difference. Result has 371 places, 360 transitions, 888 flow [2025-02-08 05:38:52,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=888, PETRI_PLACES=371, PETRI_TRANSITIONS=360} [2025-02-08 05:38:52,591 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -101 predicate places. [2025-02-08 05:38:52,591 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 360 transitions, 888 flow [2025-02-08 05:38:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 465.8333333333333) internal successors, (2795), 6 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:52,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:52,592 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] [2025-02-08 05:38:52,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:38:52,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1528128352, now seen corresponding path program 1 times [2025-02-08 05:38:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932089862] [2025-02-08 05:38:52,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:52,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:38:52,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:38:52,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932089862] [2025-02-08 05:38:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932089862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773995348] [2025-02-08 05:38:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:52,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:52,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:52,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-02-08 05:38:52,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 360 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:52,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:52,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-02-08 05:38:52,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:52,800 INFO L124 PetriNetUnfolderBase]: 36/1398 cut-off events. [2025-02-08 05:38:52,800 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:38:52,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1398 events. 36/1398 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 5613 event pairs, 0 based on Foata normal form. 0/1360 useless extension candidates. Maximal degree in co-relation 1666. Up to 60 conditions per place. [2025-02-08 05:38:52,807 INFO L140 encePairwiseOnDemand]: 508/515 looper letters, 12 selfloop transitions, 3 changer transitions 0/358 dead transitions. [2025-02-08 05:38:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 358 transitions, 914 flow [2025-02-08 05:38:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-02-08 05:38:52,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462783171521035 [2025-02-08 05:38:52,812 INFO L175 Difference]: Start difference. First operand has 371 places, 360 transitions, 888 flow. Second operand 3 states and 1462 transitions. [2025-02-08 05:38:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 358 transitions, 914 flow [2025-02-08 05:38:52,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 358 transitions, 904 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:38:52,820 INFO L231 Difference]: Finished difference. Result has 365 places, 358 transitions, 887 flow [2025-02-08 05:38:52,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=365, PETRI_TRANSITIONS=358} [2025-02-08 05:38:52,824 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -107 predicate places. [2025-02-08 05:38:52,824 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 358 transitions, 887 flow [2025-02-08 05:38:52,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:52,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:52,824 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] [2025-02-08 05:38:52,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:38:52,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1323479354, now seen corresponding path program 1 times [2025-02-08 05:38:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697053738] [2025-02-08 05:38:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:52,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:38:52,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:38:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:38:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697053738] [2025-02-08 05:38:53,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697053738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:53,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:53,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:38:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119900345] [2025-02-08 05:38:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:53,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:38:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:53,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:38:53,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:38:53,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 441 out of 515 [2025-02-08 05:38:53,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 358 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 444.6666666666667) internal successors, (2668), 6 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:53,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:53,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 441 of 515 [2025-02-08 05:38:53,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:53,656 INFO L124 PetriNetUnfolderBase]: 72/1524 cut-off events. [2025-02-08 05:38:53,656 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:38:53,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1524 events. 72/1524 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6684 event pairs, 24 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 2054. Up to 218 conditions per place. [2025-02-08 05:38:53,662 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 41 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-02-08 05:38:53,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 361 transitions, 989 flow [2025-02-08 05:38:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:38:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:38:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2691 transitions. [2025-02-08 05:38:53,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.870873786407767 [2025-02-08 05:38:53,666 INFO L175 Difference]: Start difference. First operand has 365 places, 358 transitions, 887 flow. Second operand 6 states and 2691 transitions. [2025-02-08 05:38:53,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 361 transitions, 989 flow [2025-02-08 05:38:53,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 361 transitions, 989 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:53,672 INFO L231 Difference]: Finished difference. Result has 369 places, 357 transitions, 895 flow [2025-02-08 05:38:53,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=895, PETRI_PLACES=369, PETRI_TRANSITIONS=357} [2025-02-08 05:38:53,673 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -103 predicate places. [2025-02-08 05:38:53,673 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 357 transitions, 895 flow [2025-02-08 05:38:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 444.6666666666667) internal successors, (2668), 6 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:53,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:53,674 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] [2025-02-08 05:38:53,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:38:53,675 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:38:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 64844475, now seen corresponding path program 1 times [2025-02-08 05:38:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834166657] [2025-02-08 05:38:53,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:53,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-08 05:38:53,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-08 05:38:53,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:53,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat