./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/goblint-regression/28-race_reach_90-arrayloop2_racing.i -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 f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:14,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:15,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:15,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:15,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:15,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:15,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:15,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:15,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:15,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:15,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:15,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:15,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:15,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:15,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:15,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:15,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:15,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:15,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:15,035 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 -> f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af [2025-02-06 09:27:15,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:15,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:15,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:15,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:15,275 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:15,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-02-06 09:27:16,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5204ba74/1fc82b06372f49f9ab6714b1ebe2f80f/FLAGe92f73f1e [2025-02-06 09:27:16,720 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:16,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-02-06 09:27:16,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5204ba74/1fc82b06372f49f9ab6714b1ebe2f80f/FLAGe92f73f1e [2025-02-06 09:27:16,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5204ba74/1fc82b06372f49f9ab6714b1ebe2f80f [2025-02-06 09:27:16,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:16,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:16,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:16,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:16,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:16,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:16" (1/1) ... [2025-02-06 09:27:16,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4717e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:16, skipping insertion in model container [2025-02-06 09:27:16,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:16" (1/1) ... [2025-02-06 09:27:17,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:17,417 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,417 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,418 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,418 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:17,481 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:17,529 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,529 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,530 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,530 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:27:17,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:17,601 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:17,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17 WrapperNode [2025-02-06 09:27:17,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:17,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:17,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:17,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:17,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,672 INFO L138 Inliner]: procedures = 280, calls = 143, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 526 [2025-02-06 09:27:17,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:17,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:17,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:17,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:17,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:17,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:17,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:17,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:17,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (1/1) ... [2025-02-06 09:27:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:17,757 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-06 09:27:17,762 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-06 09:27:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:27:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:27:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-02-06 09:27:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-02-06 09:27:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:27:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:27:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:27:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:27:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-02-06 09:27:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:17,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:17,779 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:27:17,904 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:17,905 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:18,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-02-06 09:27:18,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-02-06 09:27:18,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-2: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-02-06 09:27:18,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-3: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-02-06 09:27:18,640 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:18,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:18,682 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:18,682 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:18,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:18 BoogieIcfgContainer [2025-02-06 09:27:18,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:18,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:18,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:18,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:18,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:16" (1/3) ... [2025-02-06 09:27:18,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a46077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:18, skipping insertion in model container [2025-02-06 09:27:18,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:17" (2/3) ... [2025-02-06 09:27:18,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a46077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:18, skipping insertion in model container [2025-02-06 09:27:18,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:18" (3/3) ... [2025-02-06 09:27:18,689 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-02-06 09:27:18,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:18,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 552 locations, 1 initial locations, 20 loop locations, and 28 error locations. [2025-02-06 09:27:18,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:18,815 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:27:18,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 558 places, 591 transitions, 1202 flow [2025-02-06 09:27:19,087 INFO L124 PetriNetUnfolderBase]: 58/901 cut-off events. [2025-02-06 09:27:19,090 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:27:19,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 901 events. 58/901 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4266 event pairs, 0 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 501. Up to 8 conditions per place. [2025-02-06 09:27:19,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 558 places, 591 transitions, 1202 flow [2025-02-06 09:27:19,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 558 places, 591 transitions, 1202 flow [2025-02-06 09:27:19,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:19,136 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;@2efe09fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:19,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-06 09:27:19,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:19,151 INFO L124 PetriNetUnfolderBase]: 0/119 cut-off events. [2025-02-06 09:27:19,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:19,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:19,152 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] [2025-02-06 09:27:19,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:27:19,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1146798884, now seen corresponding path program 1 times [2025-02-06 09:27:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681238186] [2025-02-06 09:27:19,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:27:19,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:27:19,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:19,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:19,975 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-06 09:27:19,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681238186] [2025-02-06 09:27:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681238186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:19,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:19,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:19,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191961189] [2025-02-06 09:27:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:19,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:20,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:20,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:20,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 591 [2025-02-06 09:27:20,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 591 transitions, 1202 flow. Second operand has 6 states, 6 states have (on average 424.3333333333333) internal successors, (2546), 6 states have internal predecessors, (2546), 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-06 09:27:20,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:20,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 591 [2025-02-06 09:27:20,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:32,161 INFO L124 PetriNetUnfolderBase]: 39310/102354 cut-off events. [2025-02-06 09:27:32,162 INFO L125 PetriNetUnfolderBase]: For 1138/1325 co-relation queries the response was YES. [2025-02-06 09:27:32,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160497 conditions, 102354 events. 39310/102354 cut-off events. For 1138/1325 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 1291390 event pairs, 34452 based on Foata normal form. 14874/108392 useless extension candidates. Maximal degree in co-relation 156256. Up to 57748 conditions per place. [2025-02-06 09:27:32,708 INFO L140 encePairwiseOnDemand]: 553/591 looper letters, 128 selfloop transitions, 10 changer transitions 0/559 dead transitions. [2025-02-06 09:27:32,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1414 flow [2025-02-06 09:27:32,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2704 transitions. [2025-02-06 09:27:32,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625493513818387 [2025-02-06 09:27:32,726 INFO L175 Difference]: Start difference. First operand has 558 places, 591 transitions, 1202 flow. Second operand 6 states and 2704 transitions. [2025-02-06 09:27:32,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1414 flow [2025-02-06 09:27:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 559 transitions, 1414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:32,742 INFO L231 Difference]: Finished difference. Result has 557 places, 559 transitions, 1158 flow [2025-02-06 09:27:32,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1158, PETRI_PLACES=557, PETRI_TRANSITIONS=559} [2025-02-06 09:27:32,748 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -1 predicate places. [2025-02-06 09:27:32,748 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 559 transitions, 1158 flow [2025-02-06 09:27:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 424.3333333333333) internal successors, (2546), 6 states have internal predecessors, (2546), 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-06 09:27:32,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:32,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:32,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:27:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1470775453, now seen corresponding path program 1 times [2025-02-06 09:27:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690976963] [2025-02-06 09:27:32,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:32,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:27:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:27:32,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:32,845 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-06 09:27:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690976963] [2025-02-06 09:27:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690976963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:32,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:32,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702575801] [2025-02-06 09:27:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:32,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:32,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:32,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:32,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 591 [2025-02-06 09:27:32,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 559 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-06 09:27:32,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:32,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 591 [2025-02-06 09:27:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:33,470 INFO L124 PetriNetUnfolderBase]: 390/4310 cut-off events. [2025-02-06 09:27:33,470 INFO L125 PetriNetUnfolderBase]: For 185/186 co-relation queries the response was YES. [2025-02-06 09:27:33,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 4310 events. 390/4310 cut-off events. For 185/186 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 39410 event pairs, 264 based on Foata normal form. 1/3918 useless extension candidates. Maximal degree in co-relation 4657. Up to 567 conditions per place. [2025-02-06 09:27:33,489 INFO L140 encePairwiseOnDemand]: 588/591 looper letters, 27 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-02-06 09:27:33,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1218 flow [2025-02-06 09:27:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1635 transitions. [2025-02-06 09:27:33,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.922165820642978 [2025-02-06 09:27:33,492 INFO L175 Difference]: Start difference. First operand has 557 places, 559 transitions, 1158 flow. Second operand 3 states and 1635 transitions. [2025-02-06 09:27:33,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1218 flow [2025-02-06 09:27:33,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 560 transitions, 1198 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:33,503 INFO L231 Difference]: Finished difference. Result has 555 places, 560 transitions, 1150 flow [2025-02-06 09:27:33,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=555, PETRI_TRANSITIONS=560} [2025-02-06 09:27:33,504 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -3 predicate places. [2025-02-06 09:27:33,504 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 560 transitions, 1150 flow [2025-02-06 09:27:33,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-06 09:27:33,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:33,506 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] [2025-02-06 09:27:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:33,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:27:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -87526994, now seen corresponding path program 1 times [2025-02-06 09:27:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951111697] [2025-02-06 09:27:33,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:33,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 09:27:33,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 09:27:33,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:33,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:33,931 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-06 09:27:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951111697] [2025-02-06 09:27:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951111697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:33,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092677706] [2025-02-06 09:27:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:33,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:33,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:34,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 591 [2025-02-06 09:27:34,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 560 transitions, 1150 flow. Second operand has 6 states, 6 states have (on average 424.3333333333333) internal successors, (2546), 6 states have internal predecessors, (2546), 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-06 09:27:34,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:34,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 591 [2025-02-06 09:27:34,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:47,282 INFO L124 PetriNetUnfolderBase]: 39311/102476 cut-off events. [2025-02-06 09:27:47,282 INFO L125 PetriNetUnfolderBase]: For 1052/1239 co-relation queries the response was YES. [2025-02-06 09:27:47,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160670 conditions, 102476 events. 39311/102476 cut-off events. For 1052/1239 co-relation queries the response was YES. Maximal size of possible extension queue 2017. Compared 1292070 event pairs, 34452 based on Foata normal form. 0/93636 useless extension candidates. Maximal degree in co-relation 160403. Up to 57782 conditions per place. [2025-02-06 09:27:47,770 INFO L140 encePairwiseOnDemand]: 579/591 looper letters, 128 selfloop transitions, 10 changer transitions 0/558 dead transitions. [2025-02-06 09:27:47,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 558 transitions, 1422 flow [2025-02-06 09:27:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2678 transitions. [2025-02-06 09:27:47,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552171460800903 [2025-02-06 09:27:47,774 INFO L175 Difference]: Start difference. First operand has 555 places, 560 transitions, 1150 flow. Second operand 6 states and 2678 transitions. [2025-02-06 09:27:47,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 558 transitions, 1422 flow [2025-02-06 09:27:47,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 558 transitions, 1420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:47,782 INFO L231 Difference]: Finished difference. Result has 557 places, 558 transitions, 1164 flow [2025-02-06 09:27:47,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1164, PETRI_PLACES=557, PETRI_TRANSITIONS=558} [2025-02-06 09:27:47,783 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -1 predicate places. [2025-02-06 09:27:47,783 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 558 transitions, 1164 flow [2025-02-06 09:27:47,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 424.3333333333333) internal successors, (2546), 6 states have internal predecessors, (2546), 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-06 09:27:47,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:47,785 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] [2025-02-06 09:27:47,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:47,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:27:47,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 166982964, now seen corresponding path program 1 times [2025-02-06 09:27:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:47,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937439124] [2025-02-06 09:27:47,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:47,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 09:27:47,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 09:27:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:48,463 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-06 09:27:48,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:48,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937439124] [2025-02-06 09:27:48,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937439124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:48,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:48,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338188077] [2025-02-06 09:27:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:48,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:48,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:49,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 591 [2025-02-06 09:27:49,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 558 transitions, 1164 flow. Second operand has 6 states, 6 states have (on average 424.6666666666667) internal successors, (2548), 6 states have internal predecessors, (2548), 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-06 09:27:49,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:49,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 591 [2025-02-06 09:27:49,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:00,191 INFO L124 PetriNetUnfolderBase]: 39311/102474 cut-off events. [2025-02-06 09:28:00,191 INFO L125 PetriNetUnfolderBase]: For 1055/1242 co-relation queries the response was YES. [2025-02-06 09:28:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160691 conditions, 102474 events. 39311/102474 cut-off events. For 1055/1242 co-relation queries the response was YES. Maximal size of possible extension queue 2017. Compared 1292031 event pairs, 34452 based on Foata normal form. 0/93636 useless extension candidates. Maximal degree in co-relation 160303. Up to 57796 conditions per place. [2025-02-06 09:28:00,647 INFO L140 encePairwiseOnDemand]: 585/591 looper letters, 135 selfloop transitions, 5 changer transitions 0/557 dead transitions. [2025-02-06 09:28:00,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 557 transitions, 1442 flow [2025-02-06 09:28:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2673 transitions. [2025-02-06 09:28:00,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7538071065989848 [2025-02-06 09:28:00,651 INFO L175 Difference]: Start difference. First operand has 557 places, 558 transitions, 1164 flow. Second operand 6 states and 2673 transitions. [2025-02-06 09:28:00,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 557 transitions, 1442 flow [2025-02-06 09:28:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 557 transitions, 1422 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:00,659 INFO L231 Difference]: Finished difference. Result has 556 places, 557 transitions, 1152 flow [2025-02-06 09:28:00,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1152, PETRI_PLACES=556, PETRI_TRANSITIONS=557} [2025-02-06 09:28:00,660 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -2 predicate places. [2025-02-06 09:28:00,660 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 557 transitions, 1152 flow [2025-02-06 09:28:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 424.6666666666667) internal successors, (2548), 6 states have internal predecessors, (2548), 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-06 09:28:00,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:00,662 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] [2025-02-06 09:28:00,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:28:00,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:28:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1086478350, now seen corresponding path program 1 times [2025-02-06 09:28:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601362812] [2025-02-06 09:28:00,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:28:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:28:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601362812] [2025-02-06 09:28:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601362812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:28:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551879373] [2025-02-06 09:28:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:00,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:00,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 591 [2025-02-06 09:28:00,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 557 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-06 09:28:00,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:00,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 591 [2025-02-06 09:28:00,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:01,238 INFO L124 PetriNetUnfolderBase]: 390/4492 cut-off events. [2025-02-06 09:28:01,238 INFO L125 PetriNetUnfolderBase]: For 185/186 co-relation queries the response was YES. [2025-02-06 09:28:01,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 4492 events. 390/4492 cut-off events. For 185/186 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 40343 event pairs, 264 based on Foata normal form. 2/4099 useless extension candidates. Maximal degree in co-relation 4742. Up to 571 conditions per place. [2025-02-06 09:28:01,269 INFO L140 encePairwiseOnDemand]: 588/591 looper letters, 27 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-02-06 09:28:01,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 558 transitions, 1212 flow [2025-02-06 09:28:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1635 transitions. [2025-02-06 09:28:01,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.922165820642978 [2025-02-06 09:28:01,272 INFO L175 Difference]: Start difference. First operand has 556 places, 557 transitions, 1152 flow. Second operand 3 states and 1635 transitions. [2025-02-06 09:28:01,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 558 transitions, 1212 flow [2025-02-06 09:28:01,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1202 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:01,279 INFO L231 Difference]: Finished difference. Result has 554 places, 558 transitions, 1154 flow [2025-02-06 09:28:01,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=554, PETRI_TRANSITIONS=558} [2025-02-06 09:28:01,281 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -4 predicate places. [2025-02-06 09:28:01,281 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 558 transitions, 1154 flow [2025-02-06 09:28:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 536.3333333333334) internal successors, (1609), 3 states have internal predecessors, (1609), 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-06 09:28:01,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:01,282 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] [2025-02-06 09:28:01,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:28:01,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:28:01,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1378300363, now seen corresponding path program 1 times [2025-02-06 09:28:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675301486] [2025-02-06 09:28:01,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:01,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:28:01,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:28:01,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:01,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675301486] [2025-02-06 09:28:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675301486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902149051] [2025-02-06 09:28:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:01,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:01,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:02,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 591 [2025-02-06 09:28:02,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 558 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 475.5) internal successors, (2853), 6 states have internal predecessors, (2853), 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-06 09:28:02,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:02,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 591 [2025-02-06 09:28:02,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,646 INFO L124 PetriNetUnfolderBase]: 3285/14486 cut-off events. [2025-02-06 09:28:04,647 INFO L125 PetriNetUnfolderBase]: For 290/389 co-relation queries the response was YES. [2025-02-06 09:28:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19783 conditions, 14486 events. 3285/14486 cut-off events. For 290/389 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 153448 event pairs, 2704 based on Foata normal form. 0/12870 useless extension candidates. Maximal degree in co-relation 19248. Up to 5147 conditions per place. [2025-02-06 09:28:04,720 INFO L140 encePairwiseOnDemand]: 585/591 looper letters, 86 selfloop transitions, 5 changer transitions 0/557 dead transitions. [2025-02-06 09:28:04,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 557 transitions, 1334 flow [2025-02-06 09:28:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2918 transitions. [2025-02-06 09:28:04,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8228990411731528 [2025-02-06 09:28:04,733 INFO L175 Difference]: Start difference. First operand has 554 places, 558 transitions, 1154 flow. Second operand 6 states and 2918 transitions. [2025-02-06 09:28:04,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 557 transitions, 1334 flow [2025-02-06 09:28:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 557 transitions, 1332 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:28:04,747 INFO L231 Difference]: Finished difference. Result has 557 places, 557 transitions, 1160 flow [2025-02-06 09:28:04,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1160, PETRI_PLACES=557, PETRI_TRANSITIONS=557} [2025-02-06 09:28:04,749 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -1 predicate places. [2025-02-06 09:28:04,749 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 557 transitions, 1160 flow [2025-02-06 09:28:04,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 475.5) internal successors, (2853), 6 states have internal predecessors, (2853), 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-06 09:28:04,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,753 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] [2025-02-06 09:28:04,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:28:04,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:28:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1227010844, now seen corresponding path program 1 times [2025-02-06 09:28:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074023246] [2025-02-06 09:28:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:28:04,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:28:04,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:28:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074023246] [2025-02-06 09:28:05,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074023246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785432288] [2025-02-06 09:28:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:05,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:06,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 591 [2025-02-06 09:28:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 557 transitions, 1160 flow. Second operand has 6 states, 6 states have (on average 427.3333333333333) internal successors, (2564), 6 states have internal predecessors, (2564), 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-06 09:28:06,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:06,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 591 [2025-02-06 09:28:06,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:19,512 INFO L124 PetriNetUnfolderBase]: 39311/102654 cut-off events. [2025-02-06 09:28:19,512 INFO L125 PetriNetUnfolderBase]: For 1055/1242 co-relation queries the response was YES. [2025-02-06 09:28:19,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160956 conditions, 102654 events. 39311/102654 cut-off events. For 1055/1242 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 1294325 event pairs, 34452 based on Foata normal form. 0/93816 useless extension candidates. Maximal degree in co-relation 160447. Up to 57862 conditions per place. [2025-02-06 09:28:20,069 INFO L140 encePairwiseOnDemand]: 585/591 looper letters, 135 selfloop transitions, 5 changer transitions 0/556 dead transitions. [2025-02-06 09:28:20,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 556 transitions, 1438 flow [2025-02-06 09:28:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2673 transitions. [2025-02-06 09:28:20,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7538071065989848 [2025-02-06 09:28:20,074 INFO L175 Difference]: Start difference. First operand has 557 places, 557 transitions, 1160 flow. Second operand 6 states and 2673 transitions. [2025-02-06 09:28:20,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 556 transitions, 1438 flow [2025-02-06 09:28:20,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 556 transitions, 1428 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:20,083 INFO L231 Difference]: Finished difference. Result has 556 places, 556 transitions, 1158 flow [2025-02-06 09:28:20,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=591, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1158, PETRI_PLACES=556, PETRI_TRANSITIONS=556} [2025-02-06 09:28:20,085 INFO L279 CegarLoopForPetriNet]: 558 programPoint places, -2 predicate places. [2025-02-06 09:28:20,085 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 556 transitions, 1158 flow [2025-02-06 09:28:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 427.3333333333333) internal successors, (2564), 6 states have internal predecessors, (2564), 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-06 09:28:20,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:20,086 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] [2025-02-06 09:28:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:28:20,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t2_funErr6ASSERT_VIOLATIONDATA_RACE, t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr5ASSERT_VIOLATIONDATA_RACE, t2_funErr4ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-02-06 09:28:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1233106674, now seen corresponding path program 1 times [2025-02-06 09:28:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614835011] [2025-02-06 09:28:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:20,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 09:28:20,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 09:28:20,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:20,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:28:20,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:20,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614835011] [2025-02-06 09:28:20,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614835011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:20,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:20,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:20,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469464056] [2025-02-06 09:28:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:20,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:20,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:20,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:21,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 591 [2025-02-06 09:28:21,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 556 transitions, 1158 flow. Second operand has 6 states, 6 states have (on average 432.0) internal successors, (2592), 6 states have internal predecessors, (2592), 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-06 09:28:21,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:21,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 591 [2025-02-06 09:28:21,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand