./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 06:50:50,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:50,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:50:50,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:50,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:50,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:50,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:50,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:50,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:50,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:50,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:50,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:50,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:50,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:50,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:50,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:50,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:50,669 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/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-03-04 06:50:50,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:50,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:50,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:50,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:50,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:50,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-03-04 06:50:52,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b13a67d5/e50df97e61634dd38fcc92961e188074/FLAG2c91484e7 [2025-03-04 06:50:52,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:52,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2025-03-04 06:50:52,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b13a67d5/e50df97e61634dd38fcc92961e188074/FLAG2c91484e7 [2025-03-04 06:50:52,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b13a67d5/e50df97e61634dd38fcc92961e188074 [2025-03-04 06:50:52,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:52,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:52,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:52,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:52,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:52,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:52" (1/1) ... [2025-03-04 06:50:52,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dba1996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:52, skipping insertion in model container [2025-03-04 06:50:52,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:52" (1/1) ... [2025-03-04 06:50:52,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:53,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:53,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:53,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:53,305 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:53,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53 WrapperNode [2025-03-04 06:50:53,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:53,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:53,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:53,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:53,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,351 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 283 [2025-03-04 06:50:53,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:53,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:53,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:53,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:53,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:53,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:53,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:53,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:53,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (1/1) ... [2025-03-04 06:50:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:53,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:50:53,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:50:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:53,445 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:50:53,584 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:53,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:53,936 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:53,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:50:54,059 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:54,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:54,108 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:54,111 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:54,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:54 BoogieIcfgContainer [2025-03-04 06:50:54,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:54,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:54,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:54,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:54,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:52" (1/3) ... [2025-03-04 06:50:54,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461de3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:54, skipping insertion in model container [2025-03-04 06:50:54,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:53" (2/3) ... [2025-03-04 06:50:54,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461de3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:54, skipping insertion in model container [2025-03-04 06:50:54,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:54" (3/3) ... [2025-03-04 06:50:54,121 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2025-03-04 06:50:54,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:54,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_78-equ_racing.i that has 2 procedures, 266 locations, 1 initial locations, 10 loop locations, and 12 error locations. [2025-03-04 06:50:54,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:54,229 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:54,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 295 transitions, 597 flow [2025-03-04 06:50:54,391 INFO L124 PetriNetUnfolderBase]: 42/421 cut-off events. [2025-03-04 06:50:54,394 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:54,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 421 events. 42/421 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1734 event pairs, 0 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 228. Up to 8 conditions per place. [2025-03-04 06:50:54,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 295 transitions, 597 flow [2025-03-04 06:50:54,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 293 transitions, 593 flow [2025-03-04 06:50:54,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:54,433 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;@4b763277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:54,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:50:54,454 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:54,456 INFO L124 PetriNetUnfolderBase]: 4/92 cut-off events. [2025-03-04 06:50:54,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:54,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:54,457 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-03-04 06:50:54,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1010565726, now seen corresponding path program 1 times [2025-03-04 06:50:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464569775] [2025-03-04 06:50:54,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:54,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:54,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464569775] [2025-03-04 06:50:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464569775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:55,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194589070] [2025-03-04 06:50:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:55,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:55,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:55,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:55,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 295 [2025-03-04 06:50:55,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 293 transitions, 593 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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-03-04 06:50:55,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:55,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 295 [2025-03-04 06:50:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:56,511 INFO L124 PetriNetUnfolderBase]: 1365/5167 cut-off events. [2025-03-04 06:50:56,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:50:56,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 5167 events. 1365/5167 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 45653 event pairs, 929 based on Foata normal form. 617/5338 useless extension candidates. Maximal degree in co-relation 7688. Up to 2550 conditions per place. [2025-03-04 06:50:56,535 INFO L140 encePairwiseOnDemand]: 244/295 looper letters, 107 selfloop transitions, 86 changer transitions 0/382 dead transitions. [2025-03-04 06:50:56,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 382 transitions, 1157 flow [2025-03-04 06:50:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-03-04 06:50:56,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8045197740112995 [2025-03-04 06:50:56,549 INFO L175 Difference]: Start difference. First operand has 268 places, 293 transitions, 593 flow. Second operand 6 states and 1424 transitions. [2025-03-04 06:50:56,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 382 transitions, 1157 flow [2025-03-04 06:50:56,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 382 transitions, 1157 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:56,568 INFO L231 Difference]: Finished difference. Result has 274 places, 350 transitions, 1103 flow [2025-03-04 06:50:56,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1103, PETRI_PLACES=274, PETRI_TRANSITIONS=350} [2025-03-04 06:50:56,574 INFO L279 CegarLoopForPetriNet]: 268 programPoint places, 6 predicate places. [2025-03-04 06:50:56,574 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 350 transitions, 1103 flow [2025-03-04 06:50:56,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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-03-04 06:50:56,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:56,575 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-03-04 06:50:56,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:56,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash 488467687, now seen corresponding path program 1 times [2025-03-04 06:50:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192961464] [2025-03-04 06:50:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:56,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:50:56,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:50:56,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:56,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192961464] [2025-03-04 06:50:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192961464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:56,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801161774] [2025-03-04 06:50:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:56,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 295 [2025-03-04 06:50:56,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 350 transitions, 1103 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-03-04 06:50:56,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:56,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 295 [2025-03-04 06:50:56,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:56,901 INFO L124 PetriNetUnfolderBase]: 249/1891 cut-off events. [2025-03-04 06:50:56,902 INFO L125 PetriNetUnfolderBase]: For 149/165 co-relation queries the response was YES. [2025-03-04 06:50:56,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1891 events. 249/1891 cut-off events. For 149/165 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14711 event pairs, 77 based on Foata normal form. 1/1743 useless extension candidates. Maximal degree in co-relation 2629. Up to 235 conditions per place. [2025-03-04 06:50:56,909 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 30 selfloop transitions, 3 changer transitions 0/358 dead transitions. [2025-03-04 06:50:56,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 358 transitions, 1185 flow [2025-03-04 06:50:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2025-03-04 06:50:56,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8677966101694915 [2025-03-04 06:50:56,912 INFO L175 Difference]: Start difference. First operand has 274 places, 350 transitions, 1103 flow. Second operand 3 states and 768 transitions. [2025-03-04 06:50:56,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 358 transitions, 1185 flow [2025-03-04 06:50:56,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 358 transitions, 1185 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:56,919 INFO L231 Difference]: Finished difference. Result has 277 places, 350 transitions, 1114 flow [2025-03-04 06:50:56,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=277, PETRI_TRANSITIONS=350} [2025-03-04 06:50:56,920 INFO L279 CegarLoopForPetriNet]: 268 programPoint places, 9 predicate places. [2025-03-04 06:50:56,920 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 350 transitions, 1114 flow [2025-03-04 06:50:56,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-03-04 06:50:56,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:56,921 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-03-04 06:50:56,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:50:56,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1258140362, now seen corresponding path program 1 times [2025-03-04 06:50:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124956379] [2025-03-04 06:50:56,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:56,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:50:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:50:56,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:56,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:56,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:56,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:50:56,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:50:56,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:56,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:56,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:56,995 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:56,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:50:56,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:50:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:50:56,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:56,998 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 06:50:57,001 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:57,002 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:57,045 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 358 places, 396 transitions, 808 flow [2025-03-04 06:50:57,133 INFO L124 PetriNetUnfolderBase]: 70/675 cut-off events. [2025-03-04 06:50:57,134 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:57,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 675 events. 70/675 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3271 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 423. Up to 12 conditions per place. [2025-03-04 06:50:57,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 358 places, 396 transitions, 808 flow [2025-03-04 06:50:57,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 394 transitions, 804 flow [2025-03-04 06:50:57,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:57,146 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;@4b763277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:57,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:57,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:57,153 INFO L124 PetriNetUnfolderBase]: 4/92 cut-off events. [2025-03-04 06:50:57,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:57,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:57,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:57,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:57,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 745549218, now seen corresponding path program 1 times [2025-03-04 06:50:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856894605] [2025-03-04 06:50:57,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:57,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:57,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:57,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:57,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:57,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856894605] [2025-03-04 06:50:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856894605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179471235] [2025-03-04 06:50:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:57,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:57,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:57,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:57,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 396 [2025-03-04 06:50:57,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 394 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 252.5) internal successors, (1515), 6 states have internal predecessors, (1515), 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-03-04 06:50:57,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:57,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 396 [2025-03-04 06:50:57,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:15,553 INFO L124 PetriNetUnfolderBase]: 83159/199514 cut-off events. [2025-03-04 06:51:15,554 INFO L125 PetriNetUnfolderBase]: For 1098/1098 co-relation queries the response was YES. [2025-03-04 06:51:15,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324703 conditions, 199514 events. 83159/199514 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 2651482 event pairs, 64280 based on Foata normal form. 30809/216323 useless extension candidates. Maximal degree in co-relation 297928. Up to 117070 conditions per place. [2025-03-04 06:51:16,578 INFO L140 encePairwiseOnDemand]: 313/396 looper letters, 170 selfloop transitions, 166 changer transitions 0/582 dead transitions. [2025-03-04 06:51:16,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 582 transitions, 1857 flow [2025-03-04 06:51:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1975 transitions. [2025-03-04 06:51:16,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8312289562289562 [2025-03-04 06:51:16,587 INFO L175 Difference]: Start difference. First operand has 357 places, 394 transitions, 804 flow. Second operand 6 states and 1975 transitions. [2025-03-04 06:51:16,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 582 transitions, 1857 flow [2025-03-04 06:51:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 582 transitions, 1857 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:16,610 INFO L231 Difference]: Finished difference. Result has 361 places, 517 transitions, 1806 flow [2025-03-04 06:51:16,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1806, PETRI_PLACES=361, PETRI_TRANSITIONS=517} [2025-03-04 06:51:16,612 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, 4 predicate places. [2025-03-04 06:51:16,613 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 517 transitions, 1806 flow [2025-03-04 06:51:16,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.5) internal successors, (1515), 6 states have internal predecessors, (1515), 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-03-04 06:51:16,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:16,614 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-03-04 06:51:16,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:51:16,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:51:16,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:16,615 INFO L85 PathProgramCache]: Analyzing trace with hash 975901031, now seen corresponding path program 1 times [2025-03-04 06:51:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910394474] [2025-03-04 06:51:16,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:16,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:51:16,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:51:16,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:16,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910394474] [2025-03-04 06:51:16,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910394474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:16,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:16,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:16,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017027253] [2025-03-04 06:51:16,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:16,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:16,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:16,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 396 [2025-03-04 06:51:16,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 517 transitions, 1806 flow. Second operand has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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-03-04 06:51:16,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:16,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 396 [2025-03-04 06:51:16,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:24,345 INFO L124 PetriNetUnfolderBase]: 21434/78501 cut-off events. [2025-03-04 06:51:24,345 INFO L125 PetriNetUnfolderBase]: For 8156/8769 co-relation queries the response was YES. [2025-03-04 06:51:24,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128307 conditions, 78501 events. 21434/78501 cut-off events. For 8156/8769 co-relation queries the response was YES. Maximal size of possible extension queue 1648. Compared 1110737 event pairs, 10833 based on Foata normal form. 1/71123 useless extension candidates. Maximal degree in co-relation 115337. Up to 22918 conditions per place. [2025-03-04 06:51:24,850 INFO L140 encePairwiseOnDemand]: 393/396 looper letters, 42 selfloop transitions, 3 changer transitions 0/527 dead transitions. [2025-03-04 06:51:24,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 527 transitions, 1922 flow [2025-03-04 06:51:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2025-03-04 06:51:24,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526936026936027 [2025-03-04 06:51:24,853 INFO L175 Difference]: Start difference. First operand has 361 places, 517 transitions, 1806 flow. Second operand 3 states and 1013 transitions. [2025-03-04 06:51:24,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 527 transitions, 1922 flow [2025-03-04 06:51:25,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 527 transitions, 1922 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:25,036 INFO L231 Difference]: Finished difference. Result has 364 places, 519 transitions, 1831 flow [2025-03-04 06:51:25,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1831, PETRI_PLACES=364, PETRI_TRANSITIONS=519} [2025-03-04 06:51:25,038 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, 7 predicate places. [2025-03-04 06:51:25,038 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 519 transitions, 1831 flow [2025-03-04 06:51:25,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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-03-04 06:51:25,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:25,039 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-03-04 06:51:25,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:51:25,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:51:25,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1335365038, now seen corresponding path program 1 times [2025-03-04 06:51:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443308364] [2025-03-04 06:51:25,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 06:51:25,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 06:51:25,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:25,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:51:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443308364] [2025-03-04 06:51:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443308364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074960026] [2025-03-04 06:51:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:51:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:25,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:51:25,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:51:25,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 396 [2025-03-04 06:51:25,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 519 transitions, 1831 flow. Second operand has 6 states, 6 states have (on average 262.1666666666667) internal successors, (1573), 6 states have internal predecessors, (1573), 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-03-04 06:51:25,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:25,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 396 [2025-03-04 06:51:25,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand