./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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_37-indirect_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 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:02:01,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:02:01,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:02:01,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:02:01,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:02:01,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:02:01,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:02:01,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:02:01,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:02:01,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:02:01,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:02:01,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:02:01,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:01,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:02:01,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:02:01,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:02:01,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:02:01,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:02:01,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:02:01,715 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-03-08 22:02:01,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:02:01,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:02:01,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:02:01,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:02:01,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:02:01,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-08 22:02:03,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2e81ff/817ff56c2fa74c0a9e5e3051c09a8e32/FLAG13b82f40e [2025-03-08 22:02:03,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:02:03,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-08 22:02:03,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2e81ff/817ff56c2fa74c0a9e5e3051c09a8e32/FLAG13b82f40e [2025-03-08 22:02:03,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd2e81ff/817ff56c2fa74c0a9e5e3051c09a8e32 [2025-03-08 22:02:03,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:02:03,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:02:03,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:03,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:02:03,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:02:03,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2182e893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03, skipping insertion in model container [2025-03-08 22:02:03,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:02:03,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:03,932 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:02:03,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:03,989 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:02:03,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03 WrapperNode [2025-03-08 22:02:03,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:03,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:03,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:02:03,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:02:03,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,021 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2025-03-08 22:02:04,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:04,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:02:04,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:02:04,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:02:04,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:02:04,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:02:04,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:02:04,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:02:04,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:04,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:04,073 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-08 22:02:04,075 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-08 22:02:04,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:02:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:02:04,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:02:04,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:02:04,091 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:02:04,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:02:04,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:02:04,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:02:04,389 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:02:04,475 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:02:04,476 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:02:04,497 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:02:04,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:02:04,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:04 BoogieIcfgContainer [2025-03-08 22:02:04,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:02:04,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:02:04,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:02:04,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:02:04,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:02:03" (1/3) ... [2025-03-08 22:02:04,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd696d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:04, skipping insertion in model container [2025-03-08 22:02:04,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (2/3) ... [2025-03-08 22:02:04,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd696d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:04, skipping insertion in model container [2025-03-08 22:02:04,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:04" (3/3) ... [2025-03-08 22:02:04,505 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-03-08 22:02:04,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:02:04,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 171 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-03-08 22:02:04,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:02:04,566 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:02:04,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 182 transitions, 371 flow [2025-03-08 22:02:04,684 INFO L124 PetriNetUnfolderBase]: 15/243 cut-off events. [2025-03-08 22:02:04,686 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:02:04,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 243 events. 15/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 761 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2025-03-08 22:02:04,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 182 transitions, 371 flow [2025-03-08 22:02:04,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 182 transitions, 371 flow [2025-03-08 22:02:04,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:04,731 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;@19139e5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:04,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-08 22:02:04,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:04,742 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-08 22:02:04,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:04,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:04,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -803807723, now seen corresponding path program 1 times [2025-03-08 22:02:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661823163] [2025-03-08 22:02:04,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:02:04,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:02:04,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:04,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661823163] [2025-03-08 22:02:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661823163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976523958] [2025-03-08 22:02:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:04,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:04,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-08 22:02:04,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 182 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-08 22:02:04,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:04,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-08 22:02:04,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,097 INFO L124 PetriNetUnfolderBase]: 25/492 cut-off events. [2025-03-08 22:02:05,098 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:02:05,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 492 events. 25/492 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1939 event pairs, 24 based on Foata normal form. 35/475 useless extension candidates. Maximal degree in co-relation 446. Up to 69 conditions per place. [2025-03-08 22:02:05,101 INFO L140 encePairwiseOnDemand]: 169/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-08 22:02:05,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 381 flow [2025-03-08 22:02:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-08 22:02:05,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8882783882783882 [2025-03-08 22:02:05,116 INFO L175 Difference]: Start difference. First operand has 174 places, 182 transitions, 371 flow. Second operand 3 states and 485 transitions. [2025-03-08 22:02:05,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 381 flow [2025-03-08 22:02:05,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 169 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:05,125 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 349 flow [2025-03-08 22:02:05,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2025-03-08 22:02:05,129 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -1 predicate places. [2025-03-08 22:02:05,131 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 349 flow [2025-03-08 22:02:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-08 22:02:05,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,132 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] [2025-03-08 22:02:05,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:02:05,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:05,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 634900896, now seen corresponding path program 1 times [2025-03-08 22:02:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136201424] [2025-03-08 22:02:05,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:02:05,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:02:05,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,207 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-08 22:02:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136201424] [2025-03-08 22:02:05,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136201424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892633119] [2025-03-08 22:02:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:05,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:05,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:05,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-08 22:02:05,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-08 22:02:05,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-08 22:02:05,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,292 INFO L124 PetriNetUnfolderBase]: 25/489 cut-off events. [2025-03-08 22:02:05,293 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:02:05,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 489 events. 25/489 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1927 event pairs, 24 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 525. Up to 66 conditions per place. [2025-03-08 22:02:05,295 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 14 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2025-03-08 22:02:05,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 167 transitions, 375 flow [2025-03-08 22:02:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-08 22:02:05,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8772893772893773 [2025-03-08 22:02:05,298 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 349 flow. Second operand 3 states and 479 transitions. [2025-03-08 22:02:05,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 167 transitions, 375 flow [2025-03-08 22:02:05,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:05,304 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 343 flow [2025-03-08 22:02:05,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2025-03-08 22:02:05,305 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-08 22:02:05,305 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 343 flow [2025-03-08 22:02:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-08 22:02:05,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,306 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] [2025-03-08 22:02:05,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:02:05,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:05,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash -320159850, now seen corresponding path program 1 times [2025-03-08 22:02:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917568946] [2025-03-08 22:02:05,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:02:05,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:02:05,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,369 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-08 22:02:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917568946] [2025-03-08 22:02:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917568946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275151863] [2025-03-08 22:02:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:05,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-08 22:02:05,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-08 22:02:05,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-08 22:02:05,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,459 INFO L124 PetriNetUnfolderBase]: 25/427 cut-off events. [2025-03-08 22:02:05,459 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:02:05,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 427 events. 25/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1613 event pairs, 24 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 466. Up to 68 conditions per place. [2025-03-08 22:02:05,463 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-08 22:02:05,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 377 flow [2025-03-08 22:02:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-08 22:02:05,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.86996336996337 [2025-03-08 22:02:05,465 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 343 flow. Second operand 3 states and 475 transitions. [2025-03-08 22:02:05,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 377 flow [2025-03-08 22:02:05,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:05,469 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 344 flow [2025-03-08 22:02:05,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2025-03-08 22:02:05,471 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-08 22:02:05,471 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 344 flow [2025-03-08 22:02:05,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-08 22:02:05,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,472 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] [2025-03-08 22:02:05,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:02:05,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:05,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2099860431, now seen corresponding path program 1 times [2025-03-08 22:02:05,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042249354] [2025-03-08 22:02:05,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:02:05,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:02:05,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,958 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-08 22:02:05,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042249354] [2025-03-08 22:02:05,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042249354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:05,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910146903] [2025-03-08 22:02:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:05,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:05,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:06,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2025-03-08 22:02:06,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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-03-08 22:02:06,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:06,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2025-03-08 22:02:06,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:06,524 INFO L124 PetriNetUnfolderBase]: 535/2098 cut-off events. [2025-03-08 22:02:06,524 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:02:06,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 2098 events. 535/2098 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14506 event pairs, 288 based on Foata normal form. 0/1921 useless extension candidates. Maximal degree in co-relation 3230. Up to 988 conditions per place. [2025-03-08 22:02:06,532 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 71 selfloop transitions, 70 changer transitions 0/259 dead transitions. [2025-03-08 22:02:06,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 259 transitions, 812 flow [2025-03-08 22:02:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 880 transitions. [2025-03-08 22:02:06,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058608058608059 [2025-03-08 22:02:06,535 INFO L175 Difference]: Start difference. First operand has 171 places, 166 transitions, 344 flow. Second operand 6 states and 880 transitions. [2025-03-08 22:02:06,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 259 transitions, 812 flow [2025-03-08 22:02:06,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 259 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:06,543 INFO L231 Difference]: Finished difference. Result has 179 places, 235 transitions, 802 flow [2025-03-08 22:02:06,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=802, PETRI_PLACES=179, PETRI_TRANSITIONS=235} [2025-03-08 22:02:06,544 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 5 predicate places. [2025-03-08 22:02:06,544 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 235 transitions, 802 flow [2025-03-08 22:02:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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-03-08 22:02:06,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:06,544 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] [2025-03-08 22:02:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:02:06,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1945297632, now seen corresponding path program 1 times [2025-03-08 22:02:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958958326] [2025-03-08 22:02:06,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:06,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:02:06,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:02:06,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:06,588 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-08 22:02:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958958326] [2025-03-08 22:02:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958958326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:06,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:06,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996225813] [2025-03-08 22:02:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:06,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:06,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:06,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2025-03-08 22:02:06,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 235 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-08 22:02:06,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2025-03-08 22:02:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:06,717 INFO L124 PetriNetUnfolderBase]: 176/1081 cut-off events. [2025-03-08 22:02:06,717 INFO L125 PetriNetUnfolderBase]: For 104/107 co-relation queries the response was YES. [2025-03-08 22:02:06,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1081 events. 176/1081 cut-off events. For 104/107 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6152 event pairs, 20 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1716. Up to 191 conditions per place. [2025-03-08 22:02:06,723 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 20 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2025-03-08 22:02:06,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 241 transitions, 860 flow [2025-03-08 22:02:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-08 22:02:06,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937728937728938 [2025-03-08 22:02:06,726 INFO L175 Difference]: Start difference. First operand has 179 places, 235 transitions, 802 flow. Second operand 3 states and 488 transitions. [2025-03-08 22:02:06,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 241 transitions, 860 flow [2025-03-08 22:02:06,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 241 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:06,736 INFO L231 Difference]: Finished difference. Result has 182 places, 235 transitions, 813 flow [2025-03-08 22:02:06,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=182, PETRI_TRANSITIONS=235} [2025-03-08 22:02:06,737 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 8 predicate places. [2025-03-08 22:02:06,737 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 235 transitions, 813 flow [2025-03-08 22:02:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-08 22:02:06,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:06,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:02:06,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:06,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -217490476, now seen corresponding path program 1 times [2025-03-08 22:02:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281676748] [2025-03-08 22:02:06,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:02:06,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:02:06,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:06,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:06,778 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-08 22:02:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:06,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281676748] [2025-03-08 22:02:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281676748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834961969] [2025-03-08 22:02:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:06,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:06,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:06,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-08 22:02:06,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 235 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-08 22:02:06,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:06,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-08 22:02:06,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:06,875 INFO L124 PetriNetUnfolderBase]: 160/891 cut-off events. [2025-03-08 22:02:06,875 INFO L125 PetriNetUnfolderBase]: For 93/96 co-relation queries the response was YES. [2025-03-08 22:02:06,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 891 events. 160/891 cut-off events. For 93/96 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4874 event pairs, 4 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1520. Up to 221 conditions per place. [2025-03-08 22:02:06,880 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 1 changer transitions 0/235 dead transitions. [2025-03-08 22:02:06,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 235 transitions, 847 flow [2025-03-08 22:02:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-03-08 22:02:06,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-03-08 22:02:06,882 INFO L175 Difference]: Start difference. First operand has 182 places, 235 transitions, 813 flow. Second operand 3 states and 481 transitions. [2025-03-08 22:02:06,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 235 transitions, 847 flow [2025-03-08 22:02:06,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 235 transitions, 841 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:06,889 INFO L231 Difference]: Finished difference. Result has 180 places, 233 transitions, 805 flow [2025-03-08 22:02:06,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=180, PETRI_TRANSITIONS=233} [2025-03-08 22:02:06,890 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 6 predicate places. [2025-03-08 22:02:06,891 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 233 transitions, 805 flow [2025-03-08 22:02:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-08 22:02:06,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:06,892 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] [2025-03-08 22:02:06,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:02:06,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 470671034, now seen corresponding path program 1 times [2025-03-08 22:02:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306697854] [2025-03-08 22:02:06,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:02:06,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:02:06,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:06,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:07,174 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-08 22:02:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306697854] [2025-03-08 22:02:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306697854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:07,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059194877] [2025-03-08 22:02:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:07,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:07,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:07,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 182 [2025-03-08 22:02:07,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 233 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 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-08 22:02:07,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:07,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 182 [2025-03-08 22:02:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:07,553 INFO L124 PetriNetUnfolderBase]: 310/1323 cut-off events. [2025-03-08 22:02:07,553 INFO L125 PetriNetUnfolderBase]: For 435/447 co-relation queries the response was YES. [2025-03-08 22:02:07,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1323 events. 310/1323 cut-off events. For 435/447 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8367 event pairs, 57 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 2808. Up to 561 conditions per place. [2025-03-08 22:02:07,560 INFO L140 encePairwiseOnDemand]: 164/182 looper letters, 103 selfloop transitions, 53 changer transitions 0/284 dead transitions. [2025-03-08 22:02:07,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 284 transitions, 1343 flow [2025-03-08 22:02:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2025-03-08 22:02:07,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2025-03-08 22:02:07,562 INFO L175 Difference]: Start difference. First operand has 180 places, 233 transitions, 805 flow. Second operand 6 states and 872 transitions. [2025-03-08 22:02:07,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 284 transitions, 1343 flow [2025-03-08 22:02:07,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 284 transitions, 1342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:07,569 INFO L231 Difference]: Finished difference. Result has 189 places, 276 transitions, 1292 flow [2025-03-08 22:02:07,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=189, PETRI_TRANSITIONS=276} [2025-03-08 22:02:07,570 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 15 predicate places. [2025-03-08 22:02:07,570 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 276 transitions, 1292 flow [2025-03-08 22:02:07,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 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-08 22:02:07,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:07,570 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] [2025-03-08 22:02:07,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:02:07,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1587232155, now seen corresponding path program 1 times [2025-03-08 22:02:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918498667] [2025-03-08 22:02:07,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:07,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:02:07,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:02:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:07,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:07,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:02:07,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:02:07,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:07,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:07,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:07,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:07,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-08 22:02:07,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-08 22:02:07,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-08 22:02:07,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-08 22:02:07,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-08 22:02:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-08 22:02:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-08 22:02:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-08 22:02:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-08 22:02:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:02:07,645 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:07,649 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:07,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:02:07,679 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:02:07,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 252 transitions, 520 flow [2025-03-08 22:02:07,705 INFO L124 PetriNetUnfolderBase]: 27/401 cut-off events. [2025-03-08 22:02:07,705 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:02:07,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 401 events. 27/401 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1558 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 245. Up to 6 conditions per place. [2025-03-08 22:02:07,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 252 transitions, 520 flow [2025-03-08 22:02:07,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 252 transitions, 520 flow [2025-03-08 22:02:07,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:07,711 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;@19139e5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:07,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 22:02:07,713 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:07,713 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-08 22:02:07,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:07,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:07,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:07,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:07,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1367804271, now seen corresponding path program 1 times [2025-03-08 22:02:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694559703] [2025-03-08 22:02:07,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:07,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:02:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:02:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:07,732 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-08 22:02:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694559703] [2025-03-08 22:02:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694559703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311158604] [2025-03-08 22:02:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:07,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:07,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:07,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:07,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2025-03-08 22:02:07,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 252 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-08 22:02:07,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:07,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2025-03-08 22:02:07,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,110 INFO L124 PetriNetUnfolderBase]: 430/3650 cut-off events. [2025-03-08 22:02:08,110 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-08 22:02:08,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 3650 events. 430/3650 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31541 event pairs, 420 based on Foata normal form. 380/3649 useless extension candidates. Maximal degree in co-relation 3675. Up to 739 conditions per place. [2025-03-08 22:02:08,129 INFO L140 encePairwiseOnDemand]: 233/252 looper letters, 24 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-03-08 22:02:08,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 233 transitions, 534 flow [2025-03-08 22:02:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-08 22:02:08,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822751322751323 [2025-03-08 22:02:08,131 INFO L175 Difference]: Start difference. First operand has 239 places, 252 transitions, 520 flow. Second operand 3 states and 667 transitions. [2025-03-08 22:02:08,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 233 transitions, 534 flow [2025-03-08 22:02:08,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:08,134 INFO L231 Difference]: Finished difference. Result has 238 places, 233 transitions, 486 flow [2025-03-08 22:02:08,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=238, PETRI_TRANSITIONS=233} [2025-03-08 22:02:08,135 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -1 predicate places. [2025-03-08 22:02:08,135 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 233 transitions, 486 flow [2025-03-08 22:02:08,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-08 22:02:08,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,135 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] [2025-03-08 22:02:08,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:02:08,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:08,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash -199894372, now seen corresponding path program 1 times [2025-03-08 22:02:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29308882] [2025-03-08 22:02:08,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:02:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:02:08,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:08,167 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-08 22:02:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29308882] [2025-03-08 22:02:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29308882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:08,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:08,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208960329] [2025-03-08 22:02:08,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:08,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:08,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:08,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 252 [2025-03-08 22:02:08,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 233 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-08 22:02:08,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:08,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 252 [2025-03-08 22:02:08,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,525 INFO L124 PetriNetUnfolderBase]: 418/3585 cut-off events. [2025-03-08 22:02:08,526 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-08 22:02:08,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 3585 events. 418/3585 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 30729 event pairs, 414 based on Foata normal form. 0/3226 useless extension candidates. Maximal degree in co-relation 4309. Up to 717 conditions per place. [2025-03-08 22:02:08,550 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 22 selfloop transitions, 1 changer transitions 0/231 dead transitions. [2025-03-08 22:02:08,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 231 transitions, 528 flow [2025-03-08 22:02:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-03-08 22:02:08,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664021164021164 [2025-03-08 22:02:08,552 INFO L175 Difference]: Start difference. First operand has 238 places, 233 transitions, 486 flow. Second operand 3 states and 655 transitions. [2025-03-08 22:02:08,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 231 transitions, 528 flow [2025-03-08 22:02:08,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:08,555 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 480 flow [2025-03-08 22:02:08,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2025-03-08 22:02:08,556 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-08 22:02:08,556 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 480 flow [2025-03-08 22:02:08,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-08 22:02:08,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,556 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] [2025-03-08 22:02:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:02:08,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:08,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -348501614, now seen corresponding path program 1 times [2025-03-08 22:02:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690030194] [2025-03-08 22:02:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:02:08,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:02:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:08,573 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-08 22:02:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690030194] [2025-03-08 22:02:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690030194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14881185] [2025-03-08 22:02:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:08,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:08,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:08,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:08,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 252 [2025-03-08 22:02:08,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-08 22:02:08,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:08,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 252 [2025-03-08 22:02:08,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,952 INFO L124 PetriNetUnfolderBase]: 564/3754 cut-off events. [2025-03-08 22:02:08,952 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-08 22:02:08,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3754 events. 564/3754 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 33417 event pairs, 552 based on Foata normal form. 0/3363 useless extension candidates. Maximal degree in co-relation 4729. Up to 957 conditions per place. [2025-03-08 22:02:08,975 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 26 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-08 22:02:08,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 534 flow [2025-03-08 22:02:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-08 22:02:08,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558201058201058 [2025-03-08 22:02:08,976 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 480 flow. Second operand 3 states and 647 transitions. [2025-03-08 22:02:08,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 534 flow [2025-03-08 22:02:08,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 230 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:08,980 INFO L231 Difference]: Finished difference. Result has 236 places, 230 transitions, 481 flow [2025-03-08 22:02:08,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=236, PETRI_TRANSITIONS=230} [2025-03-08 22:02:08,980 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-08 22:02:08,980 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 230 transitions, 481 flow [2025-03-08 22:02:08,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-08 22:02:08,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,981 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] [2025-03-08 22:02:08,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:02:08,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:08,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1784187309, now seen corresponding path program 1 times [2025-03-08 22:02:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848660371] [2025-03-08 22:02:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:02:08,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:02:08,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848660371] [2025-03-08 22:02:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848660371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880653761] [2025-03-08 22:02:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:09,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:09,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:09,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:09,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 252 [2025-03-08 22:02:09,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 230 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-08 22:02:09,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:09,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 252 [2025-03-08 22:02:09,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:14,757 INFO L124 PetriNetUnfolderBase]: 27081/64015 cut-off events. [2025-03-08 22:02:14,757 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-08 22:02:14,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106377 conditions, 64015 events. 27081/64015 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 708055 event pairs, 16728 based on Foata normal form. 0/59605 useless extension candidates. Maximal degree in co-relation 106338. Up to 37371 conditions per place. [2025-03-08 22:02:15,116 INFO L140 encePairwiseOnDemand]: 213/252 looper letters, 120 selfloop transitions, 134 changer transitions 0/412 dead transitions. [2025-03-08 22:02:15,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 412 transitions, 1358 flow [2025-03-08 22:02:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2025-03-08 22:02:15,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2025-03-08 22:02:15,119 INFO L175 Difference]: Start difference. First operand has 236 places, 230 transitions, 481 flow. Second operand 6 states and 1233 transitions. [2025-03-08 22:02:15,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 412 transitions, 1358 flow [2025-03-08 22:02:15,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 412 transitions, 1354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:15,137 INFO L231 Difference]: Finished difference. Result has 244 places, 363 transitions, 1355 flow [2025-03-08 22:02:15,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=244, PETRI_TRANSITIONS=363} [2025-03-08 22:02:15,138 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 5 predicate places. [2025-03-08 22:02:15,139 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 363 transitions, 1355 flow [2025-03-08 22:02:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-08 22:02:15,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:15,140 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] [2025-03-08 22:02:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:02:15,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:15,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1701991652, now seen corresponding path program 1 times [2025-03-08 22:02:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536376366] [2025-03-08 22:02:15,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:15,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:02:15,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:02:15,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:15,183 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-08 22:02:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536376366] [2025-03-08 22:02:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536376366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:15,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931638011] [2025-03-08 22:02:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:15,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:15,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:15,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:15,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 252 [2025-03-08 22:02:15,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 363 transitions, 1355 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-08 22:02:15,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:15,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 252 [2025-03-08 22:02:15,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:17,595 INFO L124 PetriNetUnfolderBase]: 9347/29402 cut-off events. [2025-03-08 22:02:17,595 INFO L125 PetriNetUnfolderBase]: For 4659/5158 co-relation queries the response was YES. [2025-03-08 22:02:17,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53084 conditions, 29402 events. 9347/29402 cut-off events. For 4659/5158 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 329758 event pairs, 4307 based on Foata normal form. 1/27203 useless extension candidates. Maximal degree in co-relation 53041. Up to 11206 conditions per place. [2025-03-08 22:02:17,741 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 30 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2025-03-08 22:02:17,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 371 transitions, 1443 flow [2025-03-08 22:02:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-08 22:02:17,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-08 22:02:17,743 INFO L175 Difference]: Start difference. First operand has 244 places, 363 transitions, 1355 flow. Second operand 3 states and 665 transitions. [2025-03-08 22:02:17,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 371 transitions, 1443 flow [2025-03-08 22:02:17,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 371 transitions, 1443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:17,795 INFO L231 Difference]: Finished difference. Result has 247 places, 365 transitions, 1380 flow [2025-03-08 22:02:17,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=247, PETRI_TRANSITIONS=365} [2025-03-08 22:02:17,796 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2025-03-08 22:02:17,796 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 365 transitions, 1380 flow [2025-03-08 22:02:17,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-08 22:02:17,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:17,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:17,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:02:17,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1459168908, now seen corresponding path program 1 times [2025-03-08 22:02:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337915167] [2025-03-08 22:02:17,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:17,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:02:17,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:02:17,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:17,821 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-08 22:02:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:17,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337915167] [2025-03-08 22:02:17,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337915167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:17,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:17,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370981284] [2025-03-08 22:02:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:17,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:17,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:17,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:17,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 252 [2025-03-08 22:02:17,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 365 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-08 22:02:17,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:17,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 252 [2025-03-08 22:02:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:20,297 INFO L124 PetriNetUnfolderBase]: 9497/30318 cut-off events. [2025-03-08 22:02:20,297 INFO L125 PetriNetUnfolderBase]: For 4586/4722 co-relation queries the response was YES. [2025-03-08 22:02:20,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56222 conditions, 30318 events. 9497/30318 cut-off events. For 4586/4722 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 341063 event pairs, 3088 based on Foata normal form. 0/28718 useless extension candidates. Maximal degree in co-relation 56178. Up to 10835 conditions per place. [2025-03-08 22:02:20,479 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 34 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-08 22:02:20,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 370 transitions, 1467 flow [2025-03-08 22:02:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-08 22:02:20,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624338624338624 [2025-03-08 22:02:20,482 INFO L175 Difference]: Start difference. First operand has 247 places, 365 transitions, 1380 flow. Second operand 3 states and 652 transitions. [2025-03-08 22:02:20,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 370 transitions, 1467 flow [2025-03-08 22:02:20,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 370 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:20,586 INFO L231 Difference]: Finished difference. Result has 245 places, 363 transitions, 1383 flow [2025-03-08 22:02:20,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=245, PETRI_TRANSITIONS=363} [2025-03-08 22:02:20,588 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 6 predicate places. [2025-03-08 22:02:20,588 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 363 transitions, 1383 flow [2025-03-08 22:02:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-08 22:02:20,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:20,589 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] [2025-03-08 22:02:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:02:20,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash -44859918, now seen corresponding path program 1 times [2025-03-08 22:02:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634155651] [2025-03-08 22:02:20,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:20,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:02:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:02:20,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:20,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:20,793 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-08 22:02:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634155651] [2025-03-08 22:02:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634155651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82118882] [2025-03-08 22:02:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:21,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 252 [2025-03-08 22:02:21,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 363 transitions, 1383 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-08 22:02:21,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:21,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 252 [2025-03-08 22:02:21,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:27,717 INFO L124 PetriNetUnfolderBase]: 33082/76913 cut-off events. [2025-03-08 22:02:27,717 INFO L125 PetriNetUnfolderBase]: For 31600/34605 co-relation queries the response was YES. [2025-03-08 22:02:27,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178760 conditions, 76913 events. 33082/76913 cut-off events. For 31600/34605 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 877012 event pairs, 7419 based on Foata normal form. 47/73725 useless extension candidates. Maximal degree in co-relation 178715. Up to 32092 conditions per place. [2025-03-08 22:02:28,184 INFO L140 encePairwiseOnDemand]: 204/252 looper letters, 463 selfloop transitions, 219 changer transitions 0/846 dead transitions. [2025-03-08 22:02:28,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 846 transitions, 4961 flow [2025-03-08 22:02:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1330 transitions. [2025-03-08 22:02:28,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-08 22:02:28,186 INFO L175 Difference]: Start difference. First operand has 245 places, 363 transitions, 1383 flow. Second operand 6 states and 1330 transitions. [2025-03-08 22:02:28,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 846 transitions, 4961 flow [2025-03-08 22:02:28,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 846 transitions, 4961 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:28,434 INFO L231 Difference]: Finished difference. Result has 255 places, 594 transitions, 3699 flow [2025-03-08 22:02:28,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3699, PETRI_PLACES=255, PETRI_TRANSITIONS=594} [2025-03-08 22:02:28,434 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2025-03-08 22:02:28,435 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 594 transitions, 3699 flow [2025-03-08 22:02:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-08 22:02:28,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:28,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:02:28,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:28,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1782653036, now seen corresponding path program 1 times [2025-03-08 22:02:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:28,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298912689] [2025-03-08 22:02:28,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:28,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:02:28,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:02:28,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:28,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:28,491 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-08 22:02:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298912689] [2025-03-08 22:02:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298912689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:28,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250283361] [2025-03-08 22:02:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:28,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:28,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:28,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:28,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 252 [2025-03-08 22:02:28,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 594 transitions, 3699 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 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-08 22:02:28,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:28,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 252 [2025-03-08 22:02:28,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:35,012 INFO L124 PetriNetUnfolderBase]: 22178/66253 cut-off events. [2025-03-08 22:02:35,012 INFO L125 PetriNetUnfolderBase]: For 49452/53230 co-relation queries the response was YES. [2025-03-08 22:02:35,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160392 conditions, 66253 events. 22178/66253 cut-off events. For 49452/53230 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 814252 event pairs, 2877 based on Foata normal form. 325/62941 useless extension candidates. Maximal degree in co-relation 160342. Up to 18287 conditions per place. [2025-03-08 22:02:35,511 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 54 selfloop transitions, 7 changer transitions 0/626 dead transitions. [2025-03-08 22:02:35,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 626 transitions, 3885 flow [2025-03-08 22:02:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1314 transitions. [2025-03-08 22:02:35,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2025-03-08 22:02:35,514 INFO L175 Difference]: Start difference. First operand has 255 places, 594 transitions, 3699 flow. Second operand 6 states and 1314 transitions. [2025-03-08 22:02:35,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 626 transitions, 3885 flow [2025-03-08 22:02:36,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 626 transitions, 3867 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:36,298 INFO L231 Difference]: Finished difference. Result has 263 places, 596 transitions, 3713 flow [2025-03-08 22:02:36,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3681, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3713, PETRI_PLACES=263, PETRI_TRANSITIONS=596} [2025-03-08 22:02:36,299 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places. [2025-03-08 22:02:36,299 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 596 transitions, 3713 flow [2025-03-08 22:02:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 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-08 22:02:36,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:36,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:36,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:02:36,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1554312326, now seen corresponding path program 1 times [2025-03-08 22:02:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169467880] [2025-03-08 22:02:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:36,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 22:02:36,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 22:02:36,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:36,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:36,550 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-08 22:02:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:36,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169467880] [2025-03-08 22:02:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169467880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:36,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141175170] [2025-03-08 22:02:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:36,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:36,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:36,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:36,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 252 [2025-03-08 22:02:36,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 596 transitions, 3713 flow. Second operand has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 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-08 22:02:36,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:36,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 252 [2025-03-08 22:02:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:55,137 INFO L124 PetriNetUnfolderBase]: 72624/156173 cut-off events. [2025-03-08 22:02:55,138 INFO L125 PetriNetUnfolderBase]: For 156416/167726 co-relation queries the response was YES. [2025-03-08 22:02:55,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448807 conditions, 156173 events. 72624/156173 cut-off events. For 156416/167726 co-relation queries the response was YES. Maximal size of possible extension queue 2773. Compared 1808836 event pairs, 26872 based on Foata normal form. 884/152684 useless extension candidates. Maximal degree in co-relation 448753. Up to 97837 conditions per place. [2025-03-08 22:02:56,676 INFO L140 encePairwiseOnDemand]: 213/252 looper letters, 536 selfloop transitions, 284 changer transitions 0/979 dead transitions. [2025-03-08 22:02:56,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 979 transitions, 7787 flow [2025-03-08 22:02:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-03-08 22:02:56,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-03-08 22:02:56,678 INFO L175 Difference]: Start difference. First operand has 263 places, 596 transitions, 3713 flow. Second operand 6 states and 1224 transitions. [2025-03-08 22:02:56,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 979 transitions, 7787 flow [2025-03-08 22:02:57,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 979 transitions, 7777 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:57,285 INFO L231 Difference]: Finished difference. Result has 271 places, 878 transitions, 7067 flow [2025-03-08 22:02:57,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3703, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7067, PETRI_PLACES=271, PETRI_TRANSITIONS=878} [2025-03-08 22:02:57,286 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 32 predicate places. [2025-03-08 22:02:57,286 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 878 transitions, 7067 flow [2025-03-08 22:02:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 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-08 22:02:57,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:57,286 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-08 22:02:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:02:57,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 22:02:57,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1886695614, now seen corresponding path program 1 times [2025-03-08 22:02:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96379242] [2025-03-08 22:02:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:57,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 22:02:57,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 22:02:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:57,698 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-08 22:02:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:57,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96379242] [2025-03-08 22:02:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96379242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:57,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:57,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:02:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478145787] [2025-03-08 22:02:57,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:57,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:02:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:02:57,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:02:58,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 252 [2025-03-08 22:02:58,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 878 transitions, 7067 flow. Second operand has 12 states, 12 states have (on average 158.08333333333334) internal successors, (1897), 12 states have internal predecessors, (1897), 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-08 22:02:58,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:58,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 252 [2025-03-08 22:02:58,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand