./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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_78-equ_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 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:28:30,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:28:30,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:28:30,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:28:30,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:28:30,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:28:30,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:28:30,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:28:30,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:28:30,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:28:30,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:28:30,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:28:30,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:30,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:30,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:30,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:28:30,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:28:30,623 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 -> 246cd07a930f0cb8d777c2eae74f25d04e3267c275b813f0c0f5232c23299340 [2025-01-09 21:28:30,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:28:30,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:28:30,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:28:30,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:28:30,839 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:28:30,841 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_78-equ_racing.i [2025-01-09 21:28:32,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5e38300a/bc04a44145544be1b4c2e5fb63cedc5c/FLAGfa9420498 [2025-01-09 21:28:32,322 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:28:32,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-01-09 21:28:32,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5e38300a/bc04a44145544be1b4c2e5fb63cedc5c/FLAGfa9420498 [2025-01-09 21:28:32,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5e38300a/bc04a44145544be1b4c2e5fb63cedc5c [2025-01-09 21:28:32,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:28:32,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:28:32,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:32,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:28:32,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:28:32,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bc534f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32, skipping insertion in model container [2025-01-09 21:28:32,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:28:32,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:32,685 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:28:32,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:32,781 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:28:32,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32 WrapperNode [2025-01-09 21:28:32,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:32,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:32,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:28:32,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:28:32,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,818 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 283 [2025-01-09 21:28:32,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:32,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:28:32,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:28:32,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:28:32,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:28:32,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:28:32,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:28:32,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:28:32,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (1/1) ... [2025-01-09 21:28:32,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:32,885 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-01-09 21:28:32,887 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-01-09 21:28:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:28:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:28:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:28:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:28:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:28:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:28:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:28:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:28:32,905 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:28:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:28:32,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:28:32,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:28:32,907 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:28:33,016 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:28:33,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:28:33,383 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:28:33,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:28:33,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:28:33,425 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 21:28:33,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:33 BoogieIcfgContainer [2025-01-09 21:28:33,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:28:33,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:28:33,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:28:33,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:28:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:28:32" (1/3) ... [2025-01-09 21:28:33,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f1fe61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:33, skipping insertion in model container [2025-01-09 21:28:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:32" (2/3) ... [2025-01-09 21:28:33,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f1fe61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:33, skipping insertion in model container [2025-01-09 21:28:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:33" (3/3) ... [2025-01-09 21:28:33,433 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2025-01-09 21:28:33,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:28:33,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_78-equ_racing.i that has 2 procedures, 268 locations, 1 initial locations, 12 loop locations, and 12 error locations. [2025-01-09 21:28:33,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:28:33,512 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:28:33,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 297 transitions, 601 flow [2025-01-09 21:28:33,685 INFO L124 PetriNetUnfolderBase]: 42/424 cut-off events. [2025-01-09 21:28:33,687 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:28:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 424 events. 42/424 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1737 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 230. Up to 8 conditions per place. [2025-01-09 21:28:33,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 297 transitions, 601 flow [2025-01-09 21:28:33,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 295 transitions, 597 flow [2025-01-09 21:28:33,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:33,723 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;@48d6df3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:33,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:28:33,734 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:33,734 INFO L124 PetriNetUnfolderBase]: 4/95 cut-off events. [2025-01-09 21:28:33,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:33,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:33,735 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] [2025-01-09 21:28:33,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:33,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -412462470, now seen corresponding path program 1 times [2025-01-09 21:28:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227903135] [2025-01-09 21:28:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:33,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:33,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227903135] [2025-01-09 21:28:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227903135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:34,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:34,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158101382] [2025-01-09 21:28:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:34,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:34,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:34,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:34,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 297 [2025-01-09 21:28:34,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 295 transitions, 597 flow. Second operand has 6 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 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-01-09 21:28:34,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:34,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 297 [2025-01-09 21:28:34,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:35,737 INFO L124 PetriNetUnfolderBase]: 1365/5236 cut-off events. [2025-01-09 21:28:35,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:28:35,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8008 conditions, 5236 events. 1365/5236 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 46558 event pairs, 997 based on Foata normal form. 676/5444 useless extension candidates. Maximal degree in co-relation 7752. Up to 2548 conditions per place. [2025-01-09 21:28:35,757 INFO L140 encePairwiseOnDemand]: 246/297 looper letters, 107 selfloop transitions, 86 changer transitions 0/384 dead transitions. [2025-01-09 21:28:35,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 384 transitions, 1161 flow [2025-01-09 21:28:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2025-01-09 21:28:35,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058361391694725 [2025-01-09 21:28:35,774 INFO L175 Difference]: Start difference. First operand has 270 places, 295 transitions, 597 flow. Second operand 6 states and 1436 transitions. [2025-01-09 21:28:35,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 384 transitions, 1161 flow [2025-01-09 21:28:35,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 384 transitions, 1161 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:35,787 INFO L231 Difference]: Finished difference. Result has 276 places, 352 transitions, 1107 flow [2025-01-09 21:28:35,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1107, PETRI_PLACES=276, PETRI_TRANSITIONS=352} [2025-01-09 21:28:35,790 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, 6 predicate places. [2025-01-09 21:28:35,790 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 352 transitions, 1107 flow [2025-01-09 21:28:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 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-01-09 21:28:35,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:35,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:35,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:35,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1307699601, now seen corresponding path program 1 times [2025-01-09 21:28:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531381389] [2025-01-09 21:28:35,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:28:35,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:28:35,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:35,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:35,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531381389] [2025-01-09 21:28:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531381389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:35,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901416760] [2025-01-09 21:28:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:35,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:35,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:35,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 297 [2025-01-09 21:28:35,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 352 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-01-09 21:28:35,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:35,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 297 [2025-01-09 21:28:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:36,075 INFO L124 PetriNetUnfolderBase]: 263/1915 cut-off events. [2025-01-09 21:28:36,075 INFO L125 PetriNetUnfolderBase]: For 149/165 co-relation queries the response was YES. [2025-01-09 21:28:36,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 1915 events. 263/1915 cut-off events. For 149/165 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14827 event pairs, 77 based on Foata normal form. 1/1766 useless extension candidates. Maximal degree in co-relation 2667. Up to 235 conditions per place. [2025-01-09 21:28:36,084 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 30 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2025-01-09 21:28:36,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 360 transitions, 1189 flow [2025-01-09 21:28:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2025-01-09 21:28:36,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2025-01-09 21:28:36,086 INFO L175 Difference]: Start difference. First operand has 276 places, 352 transitions, 1107 flow. Second operand 3 states and 774 transitions. [2025-01-09 21:28:36,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 360 transitions, 1189 flow [2025-01-09 21:28:36,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 360 transitions, 1189 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:36,097 INFO L231 Difference]: Finished difference. Result has 279 places, 352 transitions, 1118 flow [2025-01-09 21:28:36,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=279, PETRI_TRANSITIONS=352} [2025-01-09 21:28:36,098 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, 9 predicate places. [2025-01-09 21:28:36,098 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 352 transitions, 1118 flow [2025-01-09 21:28:36,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-01-09 21:28:36,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:36,099 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:28:36,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:28:36,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:36,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1352846260, now seen corresponding path program 1 times [2025-01-09 21:28:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438621855] [2025-01-09 21:28:36,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:28:36,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:28:36,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:36,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:36,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:28:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:28:36,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:36,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:36,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:36,163 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:36,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:28:36,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:28:36,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:28:36,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:28:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:36,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:28:36,169 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:36,169 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:36,207 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:36,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 361 places, 399 transitions, 814 flow [2025-01-09 21:28:36,275 INFO L124 PetriNetUnfolderBase]: 70/680 cut-off events. [2025-01-09 21:28:36,275 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:28:36,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 680 events. 70/680 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3312 event pairs, 0 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 426. Up to 12 conditions per place. [2025-01-09 21:28:36,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 399 transitions, 814 flow [2025-01-09 21:28:36,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 360 places, 397 transitions, 810 flow [2025-01-09 21:28:36,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:36,286 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;@48d6df3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:36,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:28:36,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:36,290 INFO L124 PetriNetUnfolderBase]: 4/95 cut-off events. [2025-01-09 21:28:36,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:36,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:36,290 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] [2025-01-09 21:28:36,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:36,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1961881990, now seen corresponding path program 1 times [2025-01-09 21:28:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759159110] [2025-01-09 21:28:36,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:36,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:36,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:36,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:36,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759159110] [2025-01-09 21:28:36,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759159110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:36,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:36,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:36,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034380224] [2025-01-09 21:28:36,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:36,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:36,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:36,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:36,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:36,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 399 [2025-01-09 21:28:36,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 397 transitions, 810 flow. Second operand has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 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-01-09 21:28:36,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:36,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 399 [2025-01-09 21:28:36,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:53,865 INFO L124 PetriNetUnfolderBase]: 83151/197392 cut-off events. [2025-01-09 21:28:53,866 INFO L125 PetriNetUnfolderBase]: For 1044/1044 co-relation queries the response was YES. [2025-01-09 21:28:54,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322607 conditions, 197392 events. 83151/197392 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 3622. Compared 2602042 event pairs, 59498 based on Foata normal form. 34503/218541 useless extension candidates. Maximal degree in co-relation 214283. Up to 117106 conditions per place. [2025-01-09 21:28:54,842 INFO L140 encePairwiseOnDemand]: 316/399 looper letters, 170 selfloop transitions, 166 changer transitions 0/585 dead transitions. [2025-01-09 21:28:54,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 585 transitions, 1863 flow [2025-01-09 21:28:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-01-09 21:28:54,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8324979114452798 [2025-01-09 21:28:54,846 INFO L175 Difference]: Start difference. First operand has 360 places, 397 transitions, 810 flow. Second operand 6 states and 1993 transitions. [2025-01-09 21:28:54,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 585 transitions, 1863 flow [2025-01-09 21:28:54,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 585 transitions, 1863 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:54,857 INFO L231 Difference]: Finished difference. Result has 364 places, 520 transitions, 1812 flow [2025-01-09 21:28:54,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1812, PETRI_PLACES=364, PETRI_TRANSITIONS=520} [2025-01-09 21:28:54,858 INFO L279 CegarLoopForPetriNet]: 360 programPoint places, 4 predicate places. [2025-01-09 21:28:54,858 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 520 transitions, 1812 flow [2025-01-09 21:28:54,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 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-01-09 21:28:54,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:54,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, 1] [2025-01-09 21:28:54,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:28:54,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:54,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash 419856399, now seen corresponding path program 1 times [2025-01-09 21:28:54,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:54,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687477887] [2025-01-09 21:28:54,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:54,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:28:54,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:28:54,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:54,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:54,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:54,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687477887] [2025-01-09 21:28:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687477887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626143021] [2025-01-09 21:28:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:54,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:54,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:54,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 399 [2025-01-09 21:28:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 520 transitions, 1812 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-01-09 21:28:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 399 [2025-01-09 21:28:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:02,131 INFO L124 PetriNetUnfolderBase]: 20082/75776 cut-off events. [2025-01-09 21:29:02,132 INFO L125 PetriNetUnfolderBase]: For 8127/8827 co-relation queries the response was YES. [2025-01-09 21:29:02,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124103 conditions, 75776 events. 20082/75776 cut-off events. For 8127/8827 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 1073309 event pairs, 10710 based on Foata normal form. 1/68662 useless extension candidates. Maximal degree in co-relation 55978. Up to 22916 conditions per place. [2025-01-09 21:29:02,773 INFO L140 encePairwiseOnDemand]: 396/399 looper letters, 42 selfloop transitions, 3 changer transitions 0/530 dead transitions. [2025-01-09 21:29:02,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 530 transitions, 1928 flow [2025-01-09 21:29:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2025-01-09 21:29:02,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8538011695906432 [2025-01-09 21:29:02,780 INFO L175 Difference]: Start difference. First operand has 364 places, 520 transitions, 1812 flow. Second operand 3 states and 1022 transitions. [2025-01-09 21:29:02,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 530 transitions, 1928 flow [2025-01-09 21:29:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 530 transitions, 1928 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:03,081 INFO L231 Difference]: Finished difference. Result has 367 places, 522 transitions, 1837 flow [2025-01-09 21:29:03,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1837, PETRI_PLACES=367, PETRI_TRANSITIONS=522} [2025-01-09 21:29:03,082 INFO L279 CegarLoopForPetriNet]: 360 programPoint places, 7 predicate places. [2025-01-09 21:29:03,083 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 522 transitions, 1837 flow [2025-01-09 21:29:03,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-01-09 21:29:03,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:03,084 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] [2025-01-09 21:29:03,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:03,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:29:03,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash 449316104, now seen corresponding path program 1 times [2025-01-09 21:29:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181006247] [2025-01-09 21:29:03,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:03,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:03,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:03,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:03,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181006247] [2025-01-09 21:29:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181006247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835076568] [2025-01-09 21:29:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:03,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:03,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 399 [2025-01-09 21:29:03,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 522 transitions, 1837 flow. Second operand has 6 states, 6 states have (on average 265.1666666666667) internal successors, (1591), 6 states have internal predecessors, (1591), 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-01-09 21:29:03,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:03,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 399 [2025-01-09 21:29:03,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand