./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.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/09-regions_01-list_rc.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 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:44,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:44,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:44,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:44,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:44,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:44,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:44,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:44,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:44,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:44,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:44,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:44,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:44,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:44,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:44,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:44,378 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 -> 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc [2025-03-08 21:57:44,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:44,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:44,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:44,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:44,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:44,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-03-08 21:57:45,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee18c4d/bea266d2e1e34e339f1d621d42ddf7d1/FLAG17e4dd173 [2025-03-08 21:57:46,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:46,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-03-08 21:57:46,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee18c4d/bea266d2e1e34e339f1d621d42ddf7d1/FLAG17e4dd173 [2025-03-08 21:57:46,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee18c4d/bea266d2e1e34e339f1d621d42ddf7d1 [2025-03-08 21:57:46,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:46,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:46,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:46,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:46,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:46,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff2de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46, skipping insertion in model container [2025-03-08 21:57:46,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:46,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:46,842 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:46,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:46,925 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:46,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46 WrapperNode [2025-03-08 21:57:46,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:46,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:46,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:46,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:46,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,978 INFO L138 Inliner]: procedures = 368, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2025-03-08 21:57:46,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:46,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:46,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:46,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:46,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:46,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:47,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:47,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:47,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:47,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (1/1) ... [2025-03-08 21:57:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:47,055 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 21:57:47,058 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 21:57:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 21:57:47,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:57:47,076 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:47,076 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:47,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:47,078 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 21:57:47,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:47,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:47,486 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:47,489 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:47,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:47,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:47,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:47 BoogieIcfgContainer [2025-03-08 21:57:47,514 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:47,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:47,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:47,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:47,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:46" (1/3) ... [2025-03-08 21:57:47,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce209a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:47, skipping insertion in model container [2025-03-08 21:57:47,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:46" (2/3) ... [2025-03-08 21:57:47,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce209a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:47, skipping insertion in model container [2025-03-08 21:57:47,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:47" (3/3) ... [2025-03-08 21:57:47,521 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2025-03-08 21:57:47,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:47,535 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_01-list_rc.i that has 2 procedures, 200 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-08 21:57:47,535 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:47,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:47,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 199 transitions, 402 flow [2025-03-08 21:57:47,720 INFO L124 PetriNetUnfolderBase]: 0/198 cut-off events. [2025-03-08 21:57:47,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:47,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 198 events. 0/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-08 21:57:47,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 199 transitions, 402 flow [2025-03-08 21:57:47,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 198 transitions, 399 flow [2025-03-08 21:57:47,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:47,746 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;@55bde79f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:47,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:57:47,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:47,756 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-08 21:57:47,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:47,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:47,757 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] [2025-03-08 21:57:47,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:47,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1168016103, now seen corresponding path program 1 times [2025-03-08 21:57:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136442952] [2025-03-08 21:57:47,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:47,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 21:57:47,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 21:57:47,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:48,381 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 21:57:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136442952] [2025-03-08 21:57:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136442952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076276592] [2025-03-08 21:57:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:48,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:48,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:48,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-03-08 21:57:48,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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 21:57:48,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:48,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-03-08 21:57:48,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:48,939 INFO L124 PetriNetUnfolderBase]: 220/1022 cut-off events. [2025-03-08 21:57:48,940 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:48,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1022 events. 220/1022 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5354 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-03-08 21:57:48,946 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-03-08 21:57:48,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 509 flow [2025-03-08 21:57:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-03-08 21:57:48,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-03-08 21:57:48,957 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 399 flow. Second operand 6 states and 899 transitions. [2025-03-08 21:57:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 509 flow [2025-03-08 21:57:48,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:48,968 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 414 flow [2025-03-08 21:57:48,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2025-03-08 21:57:48,973 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 2 predicate places. [2025-03-08 21:57:48,974 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 414 flow [2025-03-08 21:57:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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 21:57:48,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:48,975 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] [2025-03-08 21:57:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:48,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 263384593, now seen corresponding path program 1 times [2025-03-08 21:57:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513307190] [2025-03-08 21:57:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:48,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:57:49,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:57:49,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:49,243 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 21:57:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513307190] [2025-03-08 21:57:49,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513307190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:49,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888042664] [2025-03-08 21:57:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:49,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:49,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-03-08 21:57:49,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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 21:57:49,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:49,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-03-08 21:57:49,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:49,606 INFO L124 PetriNetUnfolderBase]: 220/1020 cut-off events. [2025-03-08 21:57:49,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:49,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 1020 events. 220/1020 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5393 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-03-08 21:57:49,610 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-03-08 21:57:49,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 524 flow [2025-03-08 21:57:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-03-08 21:57:49,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-03-08 21:57:49,612 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 414 flow. Second operand 6 states and 899 transitions. [2025-03-08 21:57:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 524 flow [2025-03-08 21:57:49,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 504 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:49,615 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-03-08 21:57:49,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-03-08 21:57:49,616 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 0 predicate places. [2025-03-08 21:57:49,616 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-03-08 21:57:49,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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 21:57:49,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:49,617 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] [2025-03-08 21:57:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:57:49,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1200784107, now seen corresponding path program 1 times [2025-03-08 21:57:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921911157] [2025-03-08 21:57:49,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:49,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 21:57:49,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 21:57:49,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:49,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:49,670 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 21:57:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921911157] [2025-03-08 21:57:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921911157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:57:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793483414] [2025-03-08 21:57:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:49,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:49,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:49,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:49,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 199 [2025-03-08 21:57:49,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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 21:57:49,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:49,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 199 [2025-03-08 21:57:49,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:49,731 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-03-08 21:57:49,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:49,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 329 events. 16/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 774 event pairs, 16 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-03-08 21:57:49,733 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 14 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-03-08 21:57:49,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 193 transitions, 440 flow [2025-03-08 21:57:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-03-08 21:57:49,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430485762144054 [2025-03-08 21:57:49,734 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 563 transitions. [2025-03-08 21:57:49,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 193 transitions, 440 flow [2025-03-08 21:57:49,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:49,737 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 392 flow [2025-03-08 21:57:49,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2025-03-08 21:57:49,738 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -4 predicate places. [2025-03-08 21:57:49,738 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 392 flow [2025-03-08 21:57:49,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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 21:57:49,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:49,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] [2025-03-08 21:57:49,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:49,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:49,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1662515571, now seen corresponding path program 1 times [2025-03-08 21:57:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:49,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350734436] [2025-03-08 21:57:49,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:49,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 21:57:49,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 21:57:49,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:49,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:49,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 21:57:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350734436] [2025-03-08 21:57:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350734436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:49,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:57:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928623117] [2025-03-08 21:57:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:49,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:49,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:49,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:49,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:49,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 199 [2025-03-08 21:57:49,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 193 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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 21:57:49,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:49,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 199 [2025-03-08 21:57:49,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:49,846 INFO L124 PetriNetUnfolderBase]: 24/406 cut-off events. [2025-03-08 21:57:49,846 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:49,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 406 events. 24/406 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1214 event pairs, 24 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-03-08 21:57:49,849 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 15 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2025-03-08 21:57:49,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 414 flow [2025-03-08 21:57:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-08 21:57:49,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9296482412060302 [2025-03-08 21:57:49,851 INFO L175 Difference]: Start difference. First operand has 198 places, 193 transitions, 392 flow. Second operand 3 states and 555 transitions. [2025-03-08 21:57:49,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 414 flow [2025-03-08 21:57:49,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 188 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:49,856 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 380 flow [2025-03-08 21:57:49,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2025-03-08 21:57:49,858 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -9 predicate places. [2025-03-08 21:57:49,858 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 380 flow [2025-03-08 21:57:49,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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 21:57:49,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:49,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:49,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:57:49,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 228672606, now seen corresponding path program 1 times [2025-03-08 21:57:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119326253] [2025-03-08 21:57:49,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:49,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 21:57:49,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 21:57:49,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:49,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:50,277 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 21:57:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119326253] [2025-03-08 21:57:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119326253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345629662] [2025-03-08 21:57:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:50,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:50,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:50,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 199 [2025-03-08 21:57:50,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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 21:57:50,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:50,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 199 [2025-03-08 21:57:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:50,633 INFO L124 PetriNetUnfolderBase]: 288/1159 cut-off events. [2025-03-08 21:57:50,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:50,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1159 events. 288/1159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6223 event pairs, 288 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-03-08 21:57:50,637 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 58 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-08 21:57:50,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 187 transitions, 504 flow [2025-03-08 21:57:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-08 21:57:50,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7319932998324958 [2025-03-08 21:57:50,640 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 380 flow. Second operand 6 states and 874 transitions. [2025-03-08 21:57:50,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 187 transitions, 504 flow [2025-03-08 21:57:50,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:50,644 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 387 flow [2025-03-08 21:57:50,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-03-08 21:57:50,645 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -6 predicate places. [2025-03-08 21:57:50,646 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 387 flow [2025-03-08 21:57:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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 21:57:50,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:50,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:50,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:50,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash -829438370, now seen corresponding path program 1 times [2025-03-08 21:57:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826510653] [2025-03-08 21:57:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 21:57:50,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 21:57:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:51,036 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 21:57:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826510653] [2025-03-08 21:57:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826510653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875905401] [2025-03-08 21:57:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:51,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2025-03-08 21:57:51,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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 21:57:51,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:51,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2025-03-08 21:57:51,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:51,576 INFO L124 PetriNetUnfolderBase]: 316/1485 cut-off events. [2025-03-08 21:57:51,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:51,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1485 events. 316/1485 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9163 event pairs, 36 based on Foata normal form. 0/1395 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-03-08 21:57:51,582 INFO L140 encePairwiseOnDemand]: 171/199 looper letters, 99 selfloop transitions, 70 changer transitions 0/299 dead transitions. [2025-03-08 21:57:51,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 299 transitions, 949 flow [2025-03-08 21:57:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2025-03-08 21:57:51,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567839195979899 [2025-03-08 21:57:51,586 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 387 flow. Second operand 6 states and 1023 transitions. [2025-03-08 21:57:51,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 299 transitions, 949 flow [2025-03-08 21:57:51,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 299 transitions, 939 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:51,591 INFO L231 Difference]: Finished difference. Result has 200 places, 257 transitions, 855 flow [2025-03-08 21:57:51,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=200, PETRI_TRANSITIONS=257} [2025-03-08 21:57:51,591 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -2 predicate places. [2025-03-08 21:57:51,592 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 257 transitions, 855 flow [2025-03-08 21:57:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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 21:57:51,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:51,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:51,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:57:51,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:51,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1417847922, now seen corresponding path program 1 times [2025-03-08 21:57:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073536668] [2025-03-08 21:57:51,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:51,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 21:57:51,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 21:57:51,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:51,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:51,869 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 21:57:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073536668] [2025-03-08 21:57:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073536668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539323283] [2025-03-08 21:57:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:52,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2025-03-08 21:57:52,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 257 transitions, 855 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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 21:57:52,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:52,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2025-03-08 21:57:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:52,270 INFO L124 PetriNetUnfolderBase]: 588/2256 cut-off events. [2025-03-08 21:57:52,270 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-03-08 21:57:52,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2256 events. 588/2256 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15100 event pairs, 222 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-03-08 21:57:52,282 INFO L140 encePairwiseOnDemand]: 184/199 looper letters, 106 selfloop transitions, 48 changer transitions 0/308 dead transitions. [2025-03-08 21:57:52,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 308 transitions, 1335 flow [2025-03-08 21:57:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-03-08 21:57:52,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2025-03-08 21:57:52,285 INFO L175 Difference]: Start difference. First operand has 200 places, 257 transitions, 855 flow. Second operand 6 states and 960 transitions. [2025-03-08 21:57:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 308 transitions, 1335 flow [2025-03-08 21:57:52,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 308 transitions, 1335 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:52,296 INFO L231 Difference]: Finished difference. Result has 210 places, 300 transitions, 1243 flow [2025-03-08 21:57:52,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1243, PETRI_PLACES=210, PETRI_TRANSITIONS=300} [2025-03-08 21:57:52,298 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2025-03-08 21:57:52,298 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 300 transitions, 1243 flow [2025-03-08 21:57:52,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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 21:57:52,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:52,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:52,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:52,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:52,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2093105741, now seen corresponding path program 1 times [2025-03-08 21:57:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089487719] [2025-03-08 21:57:52,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:52,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 21:57:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 21:57:52,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:52,646 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 21:57:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:52,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089487719] [2025-03-08 21:57:52,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089487719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:52,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:52,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286448655] [2025-03-08 21:57:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:52,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:52,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:52,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:52,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2025-03-08 21:57:52,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 300 transitions, 1243 flow. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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 21:57:52,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:52,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2025-03-08 21:57:52,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:53,237 INFO L124 PetriNetUnfolderBase]: 752/2809 cut-off events. [2025-03-08 21:57:53,237 INFO L125 PetriNetUnfolderBase]: For 1634/1691 co-relation queries the response was YES. [2025-03-08 21:57:53,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2809 events. 752/2809 cut-off events. For 1634/1691 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20081 event pairs, 86 based on Foata normal form. 0/2713 useless extension candidates. Maximal degree in co-relation 6514. Up to 1022 conditions per place. [2025-03-08 21:57:53,250 INFO L140 encePairwiseOnDemand]: 176/199 looper letters, 128 selfloop transitions, 136 changer transitions 4/440 dead transitions. [2025-03-08 21:57:53,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 440 transitions, 2535 flow [2025-03-08 21:57:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2025-03-08 21:57:53,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8525963149078727 [2025-03-08 21:57:53,253 INFO L175 Difference]: Start difference. First operand has 210 places, 300 transitions, 1243 flow. Second operand 6 states and 1018 transitions. [2025-03-08 21:57:53,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 440 transitions, 2535 flow [2025-03-08 21:57:53,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 440 transitions, 2517 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:53,268 INFO L231 Difference]: Finished difference. Result has 220 places, 431 transitions, 2591 flow [2025-03-08 21:57:53,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=220, PETRI_TRANSITIONS=431} [2025-03-08 21:57:53,271 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 18 predicate places. [2025-03-08 21:57:53,271 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 431 transitions, 2591 flow [2025-03-08 21:57:53,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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 21:57:53,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:53,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:53,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:53,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1407604520, now seen corresponding path program 1 times [2025-03-08 21:57:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173888652] [2025-03-08 21:57:53,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:53,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:57:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:57:53,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:53,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:53,798 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 21:57:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173888652] [2025-03-08 21:57:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173888652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 21:57:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741031429] [2025-03-08 21:57:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:53,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:53,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:54,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-08 21:57:54,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 431 transitions, 2591 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:57:54,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:54,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-08 21:57:54,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:55,646 INFO L124 PetriNetUnfolderBase]: 1151/4146 cut-off events. [2025-03-08 21:57:55,646 INFO L125 PetriNetUnfolderBase]: For 5344/5448 co-relation queries the response was YES. [2025-03-08 21:57:55,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 4146 events. 1151/4146 cut-off events. For 5344/5448 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33231 event pairs, 94 based on Foata normal form. 35/4083 useless extension candidates. Maximal degree in co-relation 11828. Up to 880 conditions per place. [2025-03-08 21:57:55,672 INFO L140 encePairwiseOnDemand]: 162/199 looper letters, 349 selfloop transitions, 159 changer transitions 4/655 dead transitions. [2025-03-08 21:57:55,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 655 transitions, 5031 flow [2025-03-08 21:57:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 21:57:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 21:57:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2077 transitions. [2025-03-08 21:57:55,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7455132806891601 [2025-03-08 21:57:55,676 INFO L175 Difference]: Start difference. First operand has 220 places, 431 transitions, 2591 flow. Second operand 14 states and 2077 transitions. [2025-03-08 21:57:55,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 655 transitions, 5031 flow [2025-03-08 21:57:55,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 655 transitions, 4959 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:55,699 INFO L231 Difference]: Finished difference. Result has 243 places, 494 transitions, 3864 flow [2025-03-08 21:57:55,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3864, PETRI_PLACES=243, PETRI_TRANSITIONS=494} [2025-03-08 21:57:55,700 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 41 predicate places. [2025-03-08 21:57:55,700 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 494 transitions, 3864 flow [2025-03-08 21:57:55,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:57:55,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:55,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:55,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:57:55,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash -152946728, now seen corresponding path program 2 times [2025-03-08 21:57:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286990179] [2025-03-08 21:57:55,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:55,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:57:55,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:57:55,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:56,149 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 21:57:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:56,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286990179] [2025-03-08 21:57:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286990179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 21:57:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245919699] [2025-03-08 21:57:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:56,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:56,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:56,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:56,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-08 21:57:56,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 494 transitions, 3864 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:57:56,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:56,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-08 21:57:56,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:58,010 INFO L124 PetriNetUnfolderBase]: 1262/4509 cut-off events. [2025-03-08 21:57:58,010 INFO L125 PetriNetUnfolderBase]: For 9526/9629 co-relation queries the response was YES. [2025-03-08 21:57:58,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14412 conditions, 4509 events. 1262/4509 cut-off events. For 9526/9629 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 36349 event pairs, 93 based on Foata normal form. 39/4426 useless extension candidates. Maximal degree in co-relation 14314. Up to 891 conditions per place. [2025-03-08 21:57:58,040 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 440 selfloop transitions, 103 changer transitions 0/686 dead transitions. [2025-03-08 21:57:58,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 686 transitions, 6408 flow [2025-03-08 21:57:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 21:57:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 21:57:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2654 transitions. [2025-03-08 21:57:58,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.701930706162391 [2025-03-08 21:57:58,044 INFO L175 Difference]: Start difference. First operand has 243 places, 494 transitions, 3864 flow. Second operand 19 states and 2654 transitions. [2025-03-08 21:57:58,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 686 transitions, 6408 flow [2025-03-08 21:57:58,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 686 transitions, 6403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:57:58,079 INFO L231 Difference]: Finished difference. Result has 267 places, 549 transitions, 4679 flow [2025-03-08 21:57:58,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4679, PETRI_PLACES=267, PETRI_TRANSITIONS=549} [2025-03-08 21:57:58,080 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 65 predicate places. [2025-03-08 21:57:58,080 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 549 transitions, 4679 flow [2025-03-08 21:57:58,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:57:58,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:58,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:58,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:57:58,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:57:58,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash -891793542, now seen corresponding path program 3 times [2025-03-08 21:57:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711138390] [2025-03-08 21:57:58,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:58,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:57:58,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:57:58,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:58,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:58,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711138390] [2025-03-08 21:57:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711138390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:58,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 21:57:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543382121] [2025-03-08 21:57:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:58,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:58,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:59,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-08 21:57:59,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 549 transitions, 4679 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:57:59,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:59,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-08 21:57:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:00,359 INFO L124 PetriNetUnfolderBase]: 1753/6359 cut-off events. [2025-03-08 21:58:00,359 INFO L125 PetriNetUnfolderBase]: For 18300/18512 co-relation queries the response was YES. [2025-03-08 21:58:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21512 conditions, 6359 events. 1753/6359 cut-off events. For 18300/18512 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 58102 event pairs, 172 based on Foata normal form. 45/6245 useless extension candidates. Maximal degree in co-relation 21404. Up to 1877 conditions per place. [2025-03-08 21:58:00,394 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 417 selfloop transitions, 204 changer transitions 1/765 dead transitions. [2025-03-08 21:58:00,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 765 transitions, 8082 flow [2025-03-08 21:58:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 21:58:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-08 21:58:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2111 transitions. [2025-03-08 21:58:00,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7072026800670017 [2025-03-08 21:58:00,397 INFO L175 Difference]: Start difference. First operand has 267 places, 549 transitions, 4679 flow. Second operand 15 states and 2111 transitions. [2025-03-08 21:58:00,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 765 transitions, 8082 flow [2025-03-08 21:58:00,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 765 transitions, 8041 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-08 21:58:00,449 INFO L231 Difference]: Finished difference. Result has 286 places, 653 transitions, 6958 flow [2025-03-08 21:58:00,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6958, PETRI_PLACES=286, PETRI_TRANSITIONS=653} [2025-03-08 21:58:00,450 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 84 predicate places. [2025-03-08 21:58:00,450 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 653 transitions, 6958 flow [2025-03-08 21:58:00,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:58:00,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:00,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:00,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:58:00,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:58:00,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -475010838, now seen corresponding path program 4 times [2025-03-08 21:58:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:00,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621125649] [2025-03-08 21:58:00,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:00,465 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:58:00,472 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 114 statements. [2025-03-08 21:58:00,472 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 21:58:00,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:00,843 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 21:58:00,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:00,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621125649] [2025-03-08 21:58:00,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621125649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:00,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:00,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 21:58:00,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151428824] [2025-03-08 21:58:00,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:00,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:00,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:01,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-08 21:58:01,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 653 transitions, 6958 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:58:01,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:01,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-08 21:58:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:03,584 INFO L124 PetriNetUnfolderBase]: 2409/8639 cut-off events. [2025-03-08 21:58:03,584 INFO L125 PetriNetUnfolderBase]: For 36231/36531 co-relation queries the response was YES. [2025-03-08 21:58:03,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31316 conditions, 8639 events. 2409/8639 cut-off events. For 36231/36531 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 85230 event pairs, 231 based on Foata normal form. 82/8520 useless extension candidates. Maximal degree in co-relation 31197. Up to 1704 conditions per place. [2025-03-08 21:58:03,639 INFO L140 encePairwiseOnDemand]: 164/199 looper letters, 511 selfloop transitions, 329 changer transitions 2/985 dead transitions. [2025-03-08 21:58:03,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 985 transitions, 12297 flow [2025-03-08 21:58:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 21:58:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 21:58:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2718 transitions. [2025-03-08 21:58:03,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7188574451203386 [2025-03-08 21:58:03,643 INFO L175 Difference]: Start difference. First operand has 286 places, 653 transitions, 6958 flow. Second operand 19 states and 2718 transitions. [2025-03-08 21:58:03,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 985 transitions, 12297 flow [2025-03-08 21:58:03,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 985 transitions, 12270 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:03,739 INFO L231 Difference]: Finished difference. Result has 316 places, 787 transitions, 10473 flow [2025-03-08 21:58:03,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=6931, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10473, PETRI_PLACES=316, PETRI_TRANSITIONS=787} [2025-03-08 21:58:03,740 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 114 predicate places. [2025-03-08 21:58:03,740 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 787 transitions, 10473 flow [2025-03-08 21:58:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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 21:58:03,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:03,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:03,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:58:03,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:58:03,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1027445459, now seen corresponding path program 1 times [2025-03-08 21:58:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934597537] [2025-03-08 21:58:03,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:58:03,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:03,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:58:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:03,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:03,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934597537] [2025-03-08 21:58:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934597537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144343300] [2025-03-08 21:58:04,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:58:04,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:04,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:04,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:04,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:58:04,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:58:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:04,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:04,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:04,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 21:58:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:04,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 21:58:04,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 21:58:04,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 21:58:04,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:58:04,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 21:58:04,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 21:58:04,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:04,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 21:58:04,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-08 21:58:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:04,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:04,486 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))))) is different from false [2025-03-08 21:58:04,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2))))))) is different from false [2025-03-08 21:58:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144343300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:58:08,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:58:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-08 21:58:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888083921] [2025-03-08 21:58:08,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:58:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:58:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:08,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:58:08,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=9, NotChecked=58, Total=306 [2025-03-08 21:58:08,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 199 [2025-03-08 21:58:08,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 787 transitions, 10473 flow. Second operand has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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 21:58:08,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:08,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 199 [2025-03-08 21:58:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:11,432 INFO L124 PetriNetUnfolderBase]: 4686/13068 cut-off events. [2025-03-08 21:58:11,432 INFO L125 PetriNetUnfolderBase]: For 66182/66420 co-relation queries the response was YES. [2025-03-08 21:58:11,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 13068 events. 4686/13068 cut-off events. For 66182/66420 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 124123 event pairs, 1219 based on Foata normal form. 78/12818 useless extension candidates. Maximal degree in co-relation 51560. Up to 4099 conditions per place. [2025-03-08 21:58:11,546 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 724 selfloop transitions, 179 changer transitions 0/990 dead transitions. [2025-03-08 21:58:11,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 990 transitions, 14575 flow [2025-03-08 21:58:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 21:58:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 21:58:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1559 transitions. [2025-03-08 21:58:11,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595836324479541 [2025-03-08 21:58:11,549 INFO L175 Difference]: Start difference. First operand has 316 places, 787 transitions, 10473 flow. Second operand 14 states and 1559 transitions. [2025-03-08 21:58:11,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 990 transitions, 14575 flow [2025-03-08 21:58:11,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 990 transitions, 14492 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:11,769 INFO L231 Difference]: Finished difference. Result has 331 places, 802 transitions, 11222 flow [2025-03-08 21:58:11,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=10406, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11222, PETRI_PLACES=331, PETRI_TRANSITIONS=802} [2025-03-08 21:58:11,770 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 129 predicate places. [2025-03-08 21:58:11,770 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 802 transitions, 11222 flow [2025-03-08 21:58:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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 21:58:11,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:11,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:11,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:58:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 21:58:11,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:58:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2089144658, now seen corresponding path program 5 times [2025-03-08 21:58:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570676710] [2025-03-08 21:58:11,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:11,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:58:12,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:12,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:12,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570676710] [2025-03-08 21:58:12,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570676710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:12,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774657056] [2025-03-08 21:58:12,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:12,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:58:12,632 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:58:12,704 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:12,704 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:12,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:12,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 21:58:12,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:12,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:58:12,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 21:58:12,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:12,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 21:58:12,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 21:58:13,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:13,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-03-08 21:58:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:13,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774657056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:58:14,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:58:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-03-08 21:58:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986577381] [2025-03-08 21:58:14,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:58:14,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 21:58:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:14,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 21:58:14,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 21:58:27,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 199 [2025-03-08 21:58:27,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 802 transitions, 11222 flow. Second operand has 35 states, 35 states have (on average 129.0857142857143) internal successors, (4518), 35 states have internal predecessors, (4518), 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 21:58:27,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:27,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 199 [2025-03-08 21:58:27,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:31,006 INFO L124 PetriNetUnfolderBase]: 3278/11720 cut-off events. [2025-03-08 21:58:31,006 INFO L125 PetriNetUnfolderBase]: For 75027/75582 co-relation queries the response was YES. [2025-03-08 21:58:31,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48221 conditions, 11720 events. 3278/11720 cut-off events. For 75027/75582 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 124922 event pairs, 314 based on Foata normal form. 126/11555 useless extension candidates. Maximal degree in co-relation 48078. Up to 2369 conditions per place. [2025-03-08 21:58:31,110 INFO L140 encePairwiseOnDemand]: 163/199 looper letters, 550 selfloop transitions, 407 changer transitions 3/1105 dead transitions. [2025-03-08 21:58:31,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1105 transitions, 17117 flow [2025-03-08 21:58:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 21:58:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 21:58:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3036 transitions. [2025-03-08 21:58:31,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6934673366834171 [2025-03-08 21:58:31,113 INFO L175 Difference]: Start difference. First operand has 331 places, 802 transitions, 11222 flow. Second operand 22 states and 3036 transitions. [2025-03-08 21:58:31,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1105 transitions, 17117 flow [2025-03-08 21:58:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1105 transitions, 16930 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:31,323 INFO L231 Difference]: Finished difference. Result has 355 places, 918 transitions, 15168 flow [2025-03-08 21:58:31,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=11098, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15168, PETRI_PLACES=355, PETRI_TRANSITIONS=918} [2025-03-08 21:58:31,324 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 153 predicate places. [2025-03-08 21:58:31,324 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 918 transitions, 15168 flow [2025-03-08 21:58:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 129.0857142857143) internal successors, (4518), 35 states have internal predecessors, (4518), 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 21:58:31,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:31,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:31,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:58:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 21:58:31,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:58:31,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1159177822, now seen corresponding path program 6 times [2025-03-08 21:58:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443528138] [2025-03-08 21:58:31,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:31,540 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:58:31,552 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:31,552 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 21:58:31,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443528138] [2025-03-08 21:58:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443528138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719826758] [2025-03-08 21:58:31,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:31,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:31,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:31,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:58:32,078 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:58:32,160 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:32,160 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 21:58:32,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:32,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 21:58:32,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:32,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 21:58:32,299 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 21:58:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 21:58:32,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:58:32,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 21:58:32,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 21:58:32,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 21:58:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-03-08 21:58:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:32,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:33,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719826758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:58:33,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:58:33,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-08 21:58:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374690151] [2025-03-08 21:58:33,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:58:33,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 21:58:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:33,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 21:58:33,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 21:58:41,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-08 21:58:41,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 918 transitions, 15168 flow. Second operand has 34 states, 34 states have (on average 132.91176470588235) internal successors, (4519), 34 states have internal predecessors, (4519), 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 21:58:41,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:41,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-08 21:58:41,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:46,472 INFO L124 PetriNetUnfolderBase]: 4371/15380 cut-off events. [2025-03-08 21:58:46,472 INFO L125 PetriNetUnfolderBase]: For 123281/124122 co-relation queries the response was YES. [2025-03-08 21:58:46,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66726 conditions, 15380 events. 4371/15380 cut-off events. For 123281/124122 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 174169 event pairs, 242 based on Foata normal form. 247/15229 useless extension candidates. Maximal degree in co-relation 66573. Up to 3140 conditions per place. [2025-03-08 21:58:46,645 INFO L140 encePairwiseOnDemand]: 169/199 looper letters, 596 selfloop transitions, 494 changer transitions 0/1239 dead transitions. [2025-03-08 21:58:46,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1239 transitions, 22496 flow [2025-03-08 21:58:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 21:58:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 21:58:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2809 transitions. [2025-03-08 21:58:46,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7057788944723619 [2025-03-08 21:58:46,647 INFO L175 Difference]: Start difference. First operand has 355 places, 918 transitions, 15168 flow. Second operand 20 states and 2809 transitions. [2025-03-08 21:58:46,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 1239 transitions, 22496 flow [2025-03-08 21:58:47,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1239 transitions, 22395 flow, removed 35 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:47,034 INFO L231 Difference]: Finished difference. Result has 374 places, 1042 transitions, 20121 flow [2025-03-08 21:58:47,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=15113, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=20121, PETRI_PLACES=374, PETRI_TRANSITIONS=1042} [2025-03-08 21:58:47,035 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 172 predicate places. [2025-03-08 21:58:47,035 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 1042 transitions, 20121 flow [2025-03-08 21:58:47,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 132.91176470588235) internal successors, (4519), 34 states have internal predecessors, (4519), 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 21:58:47,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:47,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:47,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:58:47,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:47,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:58:47,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash -142065538, now seen corresponding path program 7 times [2025-03-08 21:58:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023935400] [2025-03-08 21:58:47,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:47,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:47,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:58:47,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023935400] [2025-03-08 21:58:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023935400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561812215] [2025-03-08 21:58:47,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:47,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:58:47,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:58:47,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:58:47,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:47,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:47,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 21:58:47,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:47,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 21:58:47,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 21:58:47,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 21:58:47,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:58:47,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 21:58:47,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:47,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 21:58:47,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:47,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 21:58:47,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-08 21:58:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:47,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:47,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-08 21:58:47,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0))))) is different from false [2025-03-08 21:58:47,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-03-08 21:58:51,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:51,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-08 21:58:51,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:51,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-03-08 21:58:51,688 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-08 21:58:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-08 21:58:51,691 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-08 21:58:51,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-08 21:58:51,693 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-08 21:58:51,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-08 21:58:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:58:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561812215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:58:51,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:58:51,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-08 21:58:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459682937] [2025-03-08 21:58:51,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:58:51,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 21:58:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:51,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 21:58:51,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=228, Unknown=35, NotChecked=102, Total=420 [2025-03-08 21:58:51,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 199 [2025-03-08 21:58:51,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1042 transitions, 20121 flow. Second operand has 21 states, 21 states have (on average 99.95238095238095) internal successors, (2099), 21 states have internal predecessors, (2099), 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 21:58:51,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:51,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 199 [2025-03-08 21:58:51,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:58,947 INFO L124 PetriNetUnfolderBase]: 9085/25123 cut-off events. [2025-03-08 21:58:58,948 INFO L125 PetriNetUnfolderBase]: For 215083/215878 co-relation queries the response was YES. [2025-03-08 21:58:59,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114651 conditions, 25123 events. 9085/25123 cut-off events. For 215083/215878 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 276298 event pairs, 2036 based on Foata normal form. 182/24554 useless extension candidates. Maximal degree in co-relation 114483. Up to 6653 conditions per place. [2025-03-08 21:58:59,332 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 899 selfloop transitions, 505 changer transitions 6/1501 dead transitions. [2025-03-08 21:58:59,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1501 transitions, 28451 flow [2025-03-08 21:58:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 21:58:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 21:58:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2525 transitions. [2025-03-08 21:58:59,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5767473732297853 [2025-03-08 21:58:59,334 INFO L175 Difference]: Start difference. First operand has 374 places, 1042 transitions, 20121 flow. Second operand 22 states and 2525 transitions. [2025-03-08 21:58:59,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1501 transitions, 28451 flow [2025-03-08 21:59:00,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1501 transitions, 28257 flow, removed 67 selfloop flow, removed 10 redundant places. [2025-03-08 21:59:00,260 INFO L231 Difference]: Finished difference. Result has 394 places, 1126 transitions, 24343 flow [2025-03-08 21:59:00,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=19941, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=423, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=24343, PETRI_PLACES=394, PETRI_TRANSITIONS=1126} [2025-03-08 21:59:00,261 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 192 predicate places. [2025-03-08 21:59:00,261 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 1126 transitions, 24343 flow [2025-03-08 21:59:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 99.95238095238095) internal successors, (2099), 21 states have internal predecessors, (2099), 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 21:59:00,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:00,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:59:00,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:59:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 21:59:00,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-08 21:59:00,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2031058796, now seen corresponding path program 8 times [2025-03-08 21:59:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574286480] [2025-03-08 21:59:00,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:00,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:59:00,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:59:00,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:59:00,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574286480] [2025-03-08 21:59:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574286480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435155710] [2025-03-08 21:59:00,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:00,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:00,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:00,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:00,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:59:00,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-08 21:59:00,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:59:00,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:59:00,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 21:59:00,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:01,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 21:59:01,145 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 21:59:01,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 21:59:01,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 21:59:01,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 21:59:01,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 21:59:01,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 21:59:01,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-03-08 21:59:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:01,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435155710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:02,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-08 21:59:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739907833] [2025-03-08 21:59:02,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 21:59:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:02,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 21:59:02,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122