./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_03-list2_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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:16:04,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:16:04,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:16:04,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:16:04,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:16:04,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:16:04,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:16:04,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:16:04,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:16:04,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:16:04,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:16:04,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:16:04,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:16:04,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:16:04,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:16:04,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:16:04,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:16:04,772 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2025-03-13 22:16:05,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:16:05,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:16:05,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:16:05,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:16:05,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:16:05,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-13 22:16:06,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d1bcb0c/0793efc57ed546bcb0d3eab332081893/FLAGa6c03ccdc [2025-03-13 22:16:06,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:16:06,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-13 22:16:06,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d1bcb0c/0793efc57ed546bcb0d3eab332081893/FLAGa6c03ccdc [2025-03-13 22:16:06,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d1bcb0c/0793efc57ed546bcb0d3eab332081893 [2025-03-13 22:16:06,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:16:06,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:16:06,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:16:06,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:16:06,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:16:06,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:16:06" (1/1) ... [2025-03-13 22:16:06,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d932d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:06, skipping insertion in model container [2025-03-13 22:16:06,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:16:06" (1/1) ... [2025-03-13 22:16:06,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:16:06,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:16:06,956 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:16:07,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:16:07,065 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:16:07,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07 WrapperNode [2025-03-13 22:16:07,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:16:07,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:16:07,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:16:07,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:16:07,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,105 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2025-03-13 22:16:07,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:16:07,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:16:07,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:16:07,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:16:07,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:16:07,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:16:07,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:16:07,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:16:07,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (1/1) ... [2025-03-13 22:16:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:16:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:07,174 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-13 22:16:07,182 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-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:16:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:16:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:16:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:16:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:16:07,197 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:16:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:16:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:16:07,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:16:07,198 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:16:07,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:16:07,316 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:16:07,714 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:16:07,715 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:16:07,715 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:16:07,736 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:16:07,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:16:07 BoogieIcfgContainer [2025-03-13 22:16:07,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:16:07,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:16:07,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:16:07,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:16:07,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:16:06" (1/3) ... [2025-03-13 22:16:07,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82b858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:16:07, skipping insertion in model container [2025-03-13 22:16:07,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:16:07" (2/3) ... [2025-03-13 22:16:07,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82b858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:16:07, skipping insertion in model container [2025-03-13 22:16:07,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:16:07" (3/3) ... [2025-03-13 22:16:07,746 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2025-03-13 22:16:07,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:16:07,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-03-13 22:16:07,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:16:07,817 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:16:07,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2025-03-13 22:16:07,916 INFO L124 PetriNetUnfolderBase]: 0/275 cut-off events. [2025-03-13 22:16:07,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:07,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-13 22:16:07,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2025-03-13 22:16:07,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2025-03-13 22:16:07,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:16:07,947 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;@1329a2c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:16:07,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-13 22:16:07,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:16:07,955 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 22:16:07,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:07,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:07,957 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] [2025-03-13 22:16:07,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 568170434, now seen corresponding path program 1 times [2025-03-13 22:16:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164745985] [2025-03-13 22:16:07,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:08,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:16:08,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:16:08,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:08,620 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-13 22:16:08,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164745985] [2025-03-13 22:16:08,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164745985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:08,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146325565] [2025-03-13 22:16:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:08,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:08,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:09,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-13 22:16:09,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-13 22:16:09,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:09,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-13 22:16:09,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:09,722 INFO L124 PetriNetUnfolderBase]: 560/2328 cut-off events. [2025-03-13 22:16:09,723 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:09,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2328 events. 560/2328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14981 event pairs, 560 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3353. Up to 1193 conditions per place. [2025-03-13 22:16:09,741 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2025-03-13 22:16:09,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2025-03-13 22:16:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-13 22:16:09,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-13 22:16:09,760 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2025-03-13 22:16:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2025-03-13 22:16:09,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:09,773 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2025-03-13 22:16:09,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2025-03-13 22:16:09,779 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-13 22:16:09,779 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2025-03-13 22:16:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-13 22:16:09,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:09,780 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] [2025-03-13 22:16:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:16:09,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 362021852, now seen corresponding path program 1 times [2025-03-13 22:16:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524496559] [2025-03-13 22:16:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:16:09,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:16:09,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:09,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:10,126 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-13 22:16:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524496559] [2025-03-13 22:16:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524496559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:10,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752025726] [2025-03-13 22:16:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:10,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:10,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:10,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:10,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-13 22:16:10,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-13 22:16:10,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-13 22:16:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:10,749 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-03-13 22:16:10,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:10,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 2325 events. 560/2325 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14927 event pairs, 560 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3394. Up to 1193 conditions per place. [2025-03-13 22:16:10,758 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-03-13 22:16:10,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2025-03-13 22:16:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-13 22:16:10,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-13 22:16:10,761 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2025-03-13 22:16:10,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2025-03-13 22:16:10,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:10,765 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2025-03-13 22:16:10,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2025-03-13 22:16:10,766 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2025-03-13 22:16:10,766 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2025-03-13 22:16:10,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-13 22:16:10,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:10,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:10,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:16:10,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:10,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1063909003, now seen corresponding path program 1 times [2025-03-13 22:16:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010828935] [2025-03-13 22:16:10,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:10,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:16:10,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:16:10,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:10,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:10,817 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-13 22:16:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010828935] [2025-03-13 22:16:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010828935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756859095] [2025-03-13 22:16:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:10,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:10,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:10,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:10,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-13 22:16:10,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-13 22:16:10,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-13 22:16:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:10,919 INFO L124 PetriNetUnfolderBase]: 30/718 cut-off events. [2025-03-13 22:16:10,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:10,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2656 event pairs, 30 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-03-13 22:16:10,922 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-13 22:16:10,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2025-03-13 22:16:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-13 22:16:10,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-13 22:16:10,924 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2025-03-13 22:16:10,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2025-03-13 22:16:10,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:10,927 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2025-03-13 22:16:10,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2025-03-13 22:16:10,928 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-03-13 22:16:10,928 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2025-03-13 22:16:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-13 22:16:10,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:10,929 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] [2025-03-13 22:16:10,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:16:10,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -172935321, now seen corresponding path program 1 times [2025-03-13 22:16:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:10,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406885316] [2025-03-13 22:16:10,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:10,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:16:10,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:16:10,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:10,962 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-13 22:16:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:10,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406885316] [2025-03-13 22:16:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406885316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:10,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234657062] [2025-03-13 22:16:10,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:10,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:10,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:10,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:10,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-13 22:16:10,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-13 22:16:10,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-13 22:16:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:11,038 INFO L124 PetriNetUnfolderBase]: 36/750 cut-off events. [2025-03-13 22:16:11,039 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:11,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3013 event pairs, 36 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-03-13 22:16:11,041 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-03-13 22:16:11,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2025-03-13 22:16:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-13 22:16:11,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-13 22:16:11,043 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2025-03-13 22:16:11,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2025-03-13 22:16:11,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:11,046 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2025-03-13 22:16:11,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-03-13 22:16:11,047 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2025-03-13 22:16:11,047 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2025-03-13 22:16:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-13 22:16:11,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:11,048 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] [2025-03-13 22:16:11,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:16:11,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1900652836, now seen corresponding path program 1 times [2025-03-13 22:16:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586705413] [2025-03-13 22:16:11,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:11,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:16:11,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:16:11,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:11,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:11,384 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-13 22:16:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586705413] [2025-03-13 22:16:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586705413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30839150] [2025-03-13 22:16:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:11,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:11,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-13 22:16:11,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-13 22:16:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-13 22:16:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:11,892 INFO L124 PetriNetUnfolderBase]: 638/2519 cut-off events. [2025-03-13 22:16:11,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:11,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16189 event pairs, 638 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-03-13 22:16:11,902 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-03-13 22:16:11,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2025-03-13 22:16:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-13 22:16:11,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-13 22:16:11,905 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2025-03-13 22:16:11,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2025-03-13 22:16:11,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:11,909 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2025-03-13 22:16:11,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2025-03-13 22:16:11,910 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2025-03-13 22:16:11,910 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2025-03-13 22:16:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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-13 22:16:11,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:11,911 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] [2025-03-13 22:16:11,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:16:11,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:11,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1480404944, now seen corresponding path program 1 times [2025-03-13 22:16:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:11,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131691124] [2025-03-13 22:16:11,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:11,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:16:11,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:16:11,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:11,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:11,989 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-13 22:16:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131691124] [2025-03-13 22:16:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131691124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966018611] [2025-03-13 22:16:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:11,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:11,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:12,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-13 22:16:12,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-13 22:16:12,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:12,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-13 22:16:12,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,087 INFO L124 PetriNetUnfolderBase]: 30/706 cut-off events. [2025-03-13 22:16:12,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2681 event pairs, 30 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-03-13 22:16:12,090 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-03-13 22:16:12,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2025-03-13 22:16:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-13 22:16:12,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-13 22:16:12,093 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2025-03-13 22:16:12,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2025-03-13 22:16:12,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:12,097 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2025-03-13 22:16:12,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-03-13 22:16:12,099 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2025-03-13 22:16:12,100 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2025-03-13 22:16:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-13 22:16:12,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:12,100 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] [2025-03-13 22:16:12,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:16:12,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1807796098, now seen corresponding path program 1 times [2025-03-13 22:16:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876951854] [2025-03-13 22:16:12,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-13 22:16:12,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-13 22:16:12,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:12,166 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-13 22:16:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876951854] [2025-03-13 22:16:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876951854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:12,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:12,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:16:12,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471663689] [2025-03-13 22:16:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:12,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:12,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:12,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:12,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-13 22:16:12,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-13 22:16:12,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:12,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-13 22:16:12,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,261 INFO L124 PetriNetUnfolderBase]: 36/734 cut-off events. [2025-03-13 22:16:12,262 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:12,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2915 event pairs, 36 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-03-13 22:16:12,264 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-03-13 22:16:12,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2025-03-13 22:16:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-13 22:16:12,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-13 22:16:12,267 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2025-03-13 22:16:12,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2025-03-13 22:16:12,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:12,270 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2025-03-13 22:16:12,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2025-03-13 22:16:12,271 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2025-03-13 22:16:12,271 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2025-03-13 22:16:12,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-13 22:16:12,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:12,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:16:12,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:12,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 148805048, now seen corresponding path program 1 times [2025-03-13 22:16:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342192429] [2025-03-13 22:16:12,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:12,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-13 22:16:12,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-13 22:16:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:16:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342192429] [2025-03-13 22:16:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342192429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624680981] [2025-03-13 22:16:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:12,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:12,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-13 22:16:12,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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-13 22:16:12,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:12,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-13 22:16:12,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:13,275 INFO L124 PetriNetUnfolderBase]: 638/2432 cut-off events. [2025-03-13 22:16:13,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:16:13,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 2432 events. 638/2432 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15366 event pairs, 638 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 3737. Up to 1362 conditions per place. [2025-03-13 22:16:13,285 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2025-03-13 22:16:13,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2025-03-13 22:16:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-13 22:16:13,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-13 22:16:13,290 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2025-03-13 22:16:13,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2025-03-13 22:16:13,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:13,293 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2025-03-13 22:16:13,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2025-03-13 22:16:13,294 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2025-03-13 22:16:13,294 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2025-03-13 22:16:13,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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-13 22:16:13,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:13,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:16:13,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1139430091, now seen corresponding path program 1 times [2025-03-13 22:16:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833412033] [2025-03-13 22:16:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:13,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-13 22:16:13,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-13 22:16:13,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:13,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:16:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833412033] [2025-03-13 22:16:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833412033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:13,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745008403] [2025-03-13 22:16:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:13,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:13,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:13,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:14,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-13 22:16:14,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-13 22:16:14,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:14,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-13 22:16:14,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:14,420 INFO L124 PetriNetUnfolderBase]: 232/1787 cut-off events. [2025-03-13 22:16:14,420 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:16:14,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11405 event pairs, 20 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-03-13 22:16:14,427 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2025-03-13 22:16:14,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2025-03-13 22:16:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2025-03-13 22:16:14,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2025-03-13 22:16:14,429 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2025-03-13 22:16:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2025-03-13 22:16:14,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:14,435 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2025-03-13 22:16:14,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2025-03-13 22:16:14,436 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2025-03-13 22:16:14,436 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2025-03-13 22:16:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-13 22:16:14,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:14,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:16:14,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:14,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1005740338, now seen corresponding path program 1 times [2025-03-13 22:16:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57673684] [2025-03-13 22:16:14,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:14,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-13 22:16:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-13 22:16:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:14,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:16:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:14,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57673684] [2025-03-13 22:16:14,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57673684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:14,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:14,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522791701] [2025-03-13 22:16:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:14,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:14,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:14,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:15,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-13 22:16:15,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-13 22:16:15,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:15,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-13 22:16:15,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:15,477 INFO L124 PetriNetUnfolderBase]: 185/1591 cut-off events. [2025-03-13 22:16:15,477 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2025-03-13 22:16:15,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9985 event pairs, 75 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-03-13 22:16:15,485 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2025-03-13 22:16:15,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2025-03-13 22:16:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-13 22:16:15,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-13 22:16:15,488 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2025-03-13 22:16:15,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2025-03-13 22:16:15,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:15,496 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2025-03-13 22:16:15,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2025-03-13 22:16:15,497 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2025-03-13 22:16:15,497 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2025-03-13 22:16:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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-13 22:16:15,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:15,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:16:15,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash -374121002, now seen corresponding path program 1 times [2025-03-13 22:16:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70320035] [2025-03-13 22:16:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:15,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-13 22:16:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-13 22:16:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:15,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70320035] [2025-03-13 22:16:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70320035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396293515] [2025-03-13 22:16:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:15,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:15,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:16,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2025-03-13 22:16:16,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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-13 22:16:16,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:16,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2025-03-13 22:16:16,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:16,513 INFO L124 PetriNetUnfolderBase]: 583/2948 cut-off events. [2025-03-13 22:16:16,514 INFO L125 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2025-03-13 22:16:16,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21799 event pairs, 69 based on Foata normal form. 0/2762 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-03-13 22:16:16,526 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2025-03-13 22:16:16,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2025-03-13 22:16:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-03-13 22:16:16,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2025-03-13 22:16:16,529 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2025-03-13 22:16:16,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2025-03-13 22:16:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:16,535 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2025-03-13 22:16:16,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2025-03-13 22:16:16,536 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-13 22:16:16,536 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2025-03-13 22:16:16,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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-13 22:16:16,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:16,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:16:16,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 131184466, now seen corresponding path program 1 times [2025-03-13 22:16:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049067108] [2025-03-13 22:16:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:16:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:16:16,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049067108] [2025-03-13 22:16:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049067108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071194452] [2025-03-13 22:16:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:16,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:16,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:16,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:17,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-13 22:16:17,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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-13 22:16:17,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:17,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-13 22:16:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:17,897 INFO L124 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2025-03-13 22:16:17,897 INFO L125 PetriNetUnfolderBase]: For 3355/3415 co-relation queries the response was YES. [2025-03-13 22:16:17,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3355/3415 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 46018 event pairs, 861 based on Foata normal form. 0/5367 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-03-13 22:16:17,947 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2025-03-13 22:16:17,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2025-03-13 22:16:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-13 22:16:17,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-13 22:16:17,952 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2025-03-13 22:16:17,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2025-03-13 22:16:17,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:17,967 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2025-03-13 22:16:17,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2025-03-13 22:16:17,970 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2025-03-13 22:16:17,970 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2025-03-13 22:16:17,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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-13 22:16:17,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:17,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:16:17,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2000809424, now seen corresponding path program 1 times [2025-03-13 22:16:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622636016] [2025-03-13 22:16:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:18,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-13 22:16:18,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-13 22:16:18,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622636016] [2025-03-13 22:16:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622636016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:16:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229507026] [2025-03-13 22:16:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:16:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:18,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:16:18,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:16:18,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2025-03-13 22:16:18,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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-13 22:16:18,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:18,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2025-03-13 22:16:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:18,350 INFO L124 PetriNetUnfolderBase]: 300/1955 cut-off events. [2025-03-13 22:16:18,351 INFO L125 PetriNetUnfolderBase]: For 1127/1190 co-relation queries the response was YES. [2025-03-13 22:16:18,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1955 events. 300/1955 cut-off events. For 1127/1190 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13407 event pairs, 31 based on Foata normal form. 4/1879 useless extension candidates. Maximal degree in co-relation 4002. Up to 312 conditions per place. [2025-03-13 22:16:18,362 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2025-03-13 22:16:18,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2025-03-13 22:16:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:16:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:16:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-13 22:16:18,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2025-03-13 22:16:18,364 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2025-03-13 22:16:18,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2025-03-13 22:16:18,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:18,378 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2025-03-13 22:16:18,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2025-03-13 22:16:18,379 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2025-03-13 22:16:18,380 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2025-03-13 22:16:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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-13 22:16:18,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:18,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:18,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:16:18,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1542430266, now seen corresponding path program 1 times [2025-03-13 22:16:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160125081] [2025-03-13 22:16:18,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:18,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-13 22:16:18,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-13 22:16:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160125081] [2025-03-13 22:16:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160125081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580584613] [2025-03-13 22:16:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:18,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:18,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:18,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:19,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-13 22:16:19,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-13 22:16:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-13 22:16:19,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:19,560 INFO L124 PetriNetUnfolderBase]: 695/3124 cut-off events. [2025-03-13 22:16:19,560 INFO L125 PetriNetUnfolderBase]: For 3052/3252 co-relation queries the response was YES. [2025-03-13 22:16:19,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7481 conditions, 3124 events. 695/3124 cut-off events. For 3052/3252 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 24042 event pairs, 52 based on Foata normal form. 20/3033 useless extension candidates. Maximal degree in co-relation 7398. Up to 741 conditions per place. [2025-03-13 22:16:19,574 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2025-03-13 22:16:19,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2025-03-13 22:16:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-03-13 22:16:19,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-03-13 22:16:19,576 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2025-03-13 22:16:19,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2025-03-13 22:16:19,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:19,590 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2025-03-13 22:16:19,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2025-03-13 22:16:19,591 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2025-03-13 22:16:19,591 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2025-03-13 22:16:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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-13 22:16:19,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:19,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:19,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:16:19,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 779856701, now seen corresponding path program 1 times [2025-03-13 22:16:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007256726] [2025-03-13 22:16:19,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:16:19,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:16:19,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007256726] [2025-03-13 22:16:19,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007256726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:19,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742826488] [2025-03-13 22:16:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:19,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:19,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:19,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:20,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-13 22:16:20,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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-13 22:16:20,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:20,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-13 22:16:20,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:20,680 INFO L124 PetriNetUnfolderBase]: 608/2916 cut-off events. [2025-03-13 22:16:20,680 INFO L125 PetriNetUnfolderBase]: For 5526/5740 co-relation queries the response was YES. [2025-03-13 22:16:20,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 2916 events. 608/2916 cut-off events. For 5526/5740 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22172 event pairs, 92 based on Foata normal form. 18/2878 useless extension candidates. Maximal degree in co-relation 7806. Up to 810 conditions per place. [2025-03-13 22:16:20,695 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2025-03-13 22:16:20,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2025-03-13 22:16:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-13 22:16:20,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-13 22:16:20,699 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2025-03-13 22:16:20,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2025-03-13 22:16:20,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:20,718 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2025-03-13 22:16:20,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2025-03-13 22:16:20,720 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2025-03-13 22:16:20,720 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2025-03-13 22:16:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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-13 22:16:20,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:20,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:20,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:16:20,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1315990079, now seen corresponding path program 1 times [2025-03-13 22:16:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211152950] [2025-03-13 22:16:20,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:20,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-13 22:16:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-13 22:16:20,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:20,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:16:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211152950] [2025-03-13 22:16:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211152950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:16:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024565465] [2025-03-13 22:16:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:16:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:21,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:16:21,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:16:21,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-13 22:16:21,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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-13 22:16:21,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:21,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-13 22:16:21,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:21,958 INFO L124 PetriNetUnfolderBase]: 1547/5155 cut-off events. [2025-03-13 22:16:21,958 INFO L125 PetriNetUnfolderBase]: For 7547/7627 co-relation queries the response was YES. [2025-03-13 22:16:21,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15130 conditions, 5155 events. 1547/5155 cut-off events. For 7547/7627 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41341 event pairs, 582 based on Foata normal form. 1/5002 useless extension candidates. Maximal degree in co-relation 15043. Up to 2881 conditions per place. [2025-03-13 22:16:21,975 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2025-03-13 22:16:21,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2025-03-13 22:16:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:16:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:16:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-13 22:16:21,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-13 22:16:21,980 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2025-03-13 22:16:21,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2025-03-13 22:16:21,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:22,001 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2025-03-13 22:16:22,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2025-03-13 22:16:22,002 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2025-03-13 22:16:22,002 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2025-03-13 22:16:22,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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-13 22:16:22,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:22,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:16:22,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1067566672, now seen corresponding path program 1 times [2025-03-13 22:16:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233128174] [2025-03-13 22:16:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:22,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:16:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233128174] [2025-03-13 22:16:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233128174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628275079] [2025-03-13 22:16:23,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:23,120 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-13 22:16:23,122 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-13 22:16:23,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:16:23,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:23,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:23,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:23,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 22:16:23,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:23,367 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-13 22:16:23,413 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:16:23,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-13 22:16:23,541 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 19 treesize of output 1 [2025-03-13 22:16:23,578 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-13 22:16:23,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-13 22:16:23,643 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 14 [2025-03-13 22:16:23,681 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 14 [2025-03-13 22:16:23,715 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 14 [2025-03-13 22:16:23,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-13 22:16:23,870 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-13 22:16:23,887 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-13 22:16:23,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:23,897 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-13 22:16:23,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:23,913 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-13 22:16:23,926 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-13 22:16:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:23,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:16:23,956 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|))) is different from false [2025-03-13 22:16:23,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-13 22:16:23,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) (.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2 |c_t_funThread1of1ForFork0_#t~nondet36|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-13 22:16:26,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2014) c_~B~0.base v_ArrVal_2015) c_~A~0.base) (+ c_~A~0.offset 4)) c_~B~0.base))) is different from false [2025-03-13 22:16:26,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:26,385 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-13 22:16:26,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-13 22:16:26,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-13 22:16:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:26,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628275079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:16:26,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:16:26,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 32 [2025-03-13 22:16:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126431360] [2025-03-13 22:16:26,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:16:26,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-13 22:16:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:26,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-13 22:16:26,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=696, Unknown=23, NotChecked=228, Total=1056 [2025-03-13 22:16:26,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 276 [2025-03-13 22:16:26,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 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-13 22:16:26,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:26,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 276 [2025-03-13 22:16:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:29,303 INFO L124 PetriNetUnfolderBase]: 2472/6988 cut-off events. [2025-03-13 22:16:29,304 INFO L125 PetriNetUnfolderBase]: For 12295/12320 co-relation queries the response was YES. [2025-03-13 22:16:29,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 6988 events. 2472/6988 cut-off events. For 12295/12320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 55411 event pairs, 326 based on Foata normal form. 19/6950 useless extension candidates. Maximal degree in co-relation 23101. Up to 2994 conditions per place. [2025-03-13 22:16:29,343 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 619 selfloop transitions, 101 changer transitions 28/843 dead transitions. [2025-03-13 22:16:29,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 843 transitions, 7364 flow [2025-03-13 22:16:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 22:16:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 22:16:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3295 transitions. [2025-03-13 22:16:29,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.426371635610766 [2025-03-13 22:16:29,353 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 3295 transitions. [2025-03-13 22:16:29,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 843 transitions, 7364 flow [2025-03-13 22:16:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 843 transitions, 7160 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:29,411 INFO L231 Difference]: Finished difference. Result has 347 places, 607 transitions, 4466 flow [2025-03-13 22:16:29,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4466, PETRI_PLACES=347, PETRI_TRANSITIONS=607} [2025-03-13 22:16:29,412 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2025-03-13 22:16:29,413 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 607 transitions, 4466 flow [2025-03-13 22:16:29,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 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-13 22:16:29,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:29,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:29,422 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-13 22:16:29,618 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,SelfDestructingSolverStorable16 [2025-03-13 22:16:29,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1951234751, now seen corresponding path program 1 times [2025-03-13 22:16:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:29,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43153650] [2025-03-13 22:16:29,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:16:29,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:29,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:29,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43153650] [2025-03-13 22:16:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43153650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051419658] [2025-03-13 22:16:30,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:30,710 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-13 22:16:30,713 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-13 22:16:30,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:16:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-13 22:16:30,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:30,940 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-13 22:16:30,987 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:16:30,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-13 22:16:31,085 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 19 treesize of output 1 [2025-03-13 22:16:31,117 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-13 22:16:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-13 22:16:31,194 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 14 [2025-03-13 22:16:31,222 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 14 [2025-03-13 22:16:31,258 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 14 [2025-03-13 22:16:31,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-13 22:16:31,389 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-13 22:16:31,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:31,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-13 22:16:31,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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-13 22:16:31,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-13 22:16:31,453 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 45 treesize of output 34 [2025-03-13 22:16:31,464 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 45 treesize of output 34 [2025-03-13 22:16:31,472 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 45 treesize of output 34 [2025-03-13 22:16:31,485 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 45 treesize of output 34 [2025-03-13 22:16:31,505 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-13 22:16:31,514 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-13 22:16:31,523 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-13 22:16:31,531 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-13 22:16:31,562 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-13 22:16:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:31,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:16:31,715 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-03-13 22:16:31,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)))) is different from false [2025-03-13 22:16:31,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-13 22:16:31,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-03-13 22:16:31,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset)) (.cse4 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-13 22:16:31,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:31,853 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 46 treesize of output 62 [2025-03-13 22:16:31,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:31,858 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 206 treesize of output 170 [2025-03-13 22:16:31,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-13 22:16:31,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-13 22:16:31,885 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-13 22:16:31,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-13 22:16:31,890 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-13 22:16:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-13 22:16:31,894 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-13 22:16:31,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-13 22:16:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051419658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:16:32,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:16:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 33 [2025-03-13 22:16:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803703458] [2025-03-13 22:16:32,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:16:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:16:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:16:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=716, Unknown=13, NotChecked=290, Total=1122 [2025-03-13 22:16:32,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-13 22:16:32,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 607 transitions, 4466 flow. Second operand has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 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-13 22:16:32,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:32,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-13 22:16:32,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:35,643 INFO L124 PetriNetUnfolderBase]: 2857/8071 cut-off events. [2025-03-13 22:16:35,643 INFO L125 PetriNetUnfolderBase]: For 18510/18517 co-relation queries the response was YES. [2025-03-13 22:16:35,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28464 conditions, 8071 events. 2857/8071 cut-off events. For 18510/18517 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 66751 event pairs, 384 based on Foata normal form. 12/8000 useless extension candidates. Maximal degree in co-relation 28335. Up to 2077 conditions per place. [2025-03-13 22:16:35,695 INFO L140 encePairwiseOnDemand]: 240/276 looper letters, 775 selfloop transitions, 150 changer transitions 24/1046 dead transitions. [2025-03-13 22:16:35,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1046 transitions, 9554 flow [2025-03-13 22:16:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 22:16:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 22:16:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3218 transitions. [2025-03-13 22:16:35,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4484392419175028 [2025-03-13 22:16:35,699 INFO L175 Difference]: Start difference. First operand has 347 places, 607 transitions, 4466 flow. Second operand 26 states and 3218 transitions. [2025-03-13 22:16:35,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1046 transitions, 9554 flow [2025-03-13 22:16:35,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1046 transitions, 9430 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-03-13 22:16:35,787 INFO L231 Difference]: Finished difference. Result has 373 places, 683 transitions, 5852 flow [2025-03-13 22:16:35,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4384, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5852, PETRI_PLACES=373, PETRI_TRANSITIONS=683} [2025-03-13 22:16:35,788 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 94 predicate places. [2025-03-13 22:16:35,788 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 683 transitions, 5852 flow [2025-03-13 22:16:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 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-13 22:16:35,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:35,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:35,797 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-13 22:16:35,990 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,SelfDestructingSolverStorable17 [2025-03-13 22:16:35,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash 292131217, now seen corresponding path program 2 times [2025-03-13 22:16:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441213242] [2025-03-13 22:16:35,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:36,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-13 22:16:36,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:36,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:16:36,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:37,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441213242] [2025-03-13 22:16:37,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441213242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:37,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578388527] [2025-03-13 22:16:37,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:37,398 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-13 22:16:37,400 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-13 22:16:37,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-13 22:16:38,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:38,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:16:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:38,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-13 22:16:38,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:38,794 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-13 22:16:38,970 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-13 22:16:39,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:16:39,022 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-13 22:16:39,198 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 16 treesize of output 11 [2025-03-13 22:16:39,248 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 16 treesize of output 11 [2025-03-13 22:16:39,309 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 16 treesize of output 11 [2025-03-13 22:16:39,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-13 22:16:39,592 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-13 22:16:39,619 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-13 22:16:39,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:39,651 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 30 treesize of output 21 [2025-03-13 22:16:39,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:39,657 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-13 22:16:39,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:39,664 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-13 22:16:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:39,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:16:40,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int))) (not (= (+ 4 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2743) c_~B~0.base v_ArrVal_2744) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2743) c_~B~0.base v_ArrVal_2744) c_~A~0.base) .cse0)))))) is different from false [2025-03-13 22:16:40,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2744 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2744) c_~A~0.base) .cse0) (+ 5 |c_ULTIMATE.start_main_#t~malloc48#1.offset|)))) (forall ((v_ArrVal_2744 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2744) c_~A~0.base) .cse0) (+ 4 |c_ULTIMATE.start_main_#t~malloc48#1.offset|)))))) is different from false [2025-03-13 22:16:40,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:40,377 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-13 22:16:40,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-13 22:16:40,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-13 22:16:40,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:40,392 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 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-13 22:16:40,393 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:16:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-13 22:16:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:40,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578388527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:16:40,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:16:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 48 [2025-03-13 22:16:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100287553] [2025-03-13 22:16:40,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:16:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-13 22:16:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:40,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-13 22:16:40,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1943, Unknown=27, NotChecked=182, Total=2352 [2025-03-13 22:16:40,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-13 22:16:40,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 683 transitions, 5852 flow. Second operand has 49 states, 49 states have (on average 113.51020408163265) internal successors, (5562), 49 states have internal predecessors, (5562), 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-13 22:16:40,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:40,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-13 22:16:40,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:45,458 INFO L124 PetriNetUnfolderBase]: 3299/9227 cut-off events. [2025-03-13 22:16:45,458 INFO L125 PetriNetUnfolderBase]: For 27740/27769 co-relation queries the response was YES. [2025-03-13 22:16:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35014 conditions, 9227 events. 3299/9227 cut-off events. For 27740/27769 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 78481 event pairs, 517 based on Foata normal form. 17/9150 useless extension candidates. Maximal degree in co-relation 34872. Up to 1316 conditions per place. [2025-03-13 22:16:45,502 INFO L140 encePairwiseOnDemand]: 238/276 looper letters, 906 selfloop transitions, 215 changer transitions 19/1237 dead transitions. [2025-03-13 22:16:45,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1237 transitions, 12113 flow [2025-03-13 22:16:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-13 22:16:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-13 22:16:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4485 transitions. [2025-03-13 22:16:45,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4391891891891892 [2025-03-13 22:16:45,506 INFO L175 Difference]: Start difference. First operand has 373 places, 683 transitions, 5852 flow. Second operand 37 states and 4485 transitions. [2025-03-13 22:16:45,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1237 transitions, 12113 flow [2025-03-13 22:16:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1237 transitions, 12049 flow, removed 20 selfloop flow, removed 11 redundant places. [2025-03-13 22:16:45,620 INFO L231 Difference]: Finished difference. Result has 413 places, 780 transitions, 7512 flow [2025-03-13 22:16:45,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7512, PETRI_PLACES=413, PETRI_TRANSITIONS=780} [2025-03-13 22:16:45,621 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 134 predicate places. [2025-03-13 22:16:45,621 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 780 transitions, 7512 flow [2025-03-13 22:16:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 113.51020408163265) internal successors, (5562), 49 states have internal predecessors, (5562), 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-13 22:16:45,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:45,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:16:45,633 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-13 22:16:45,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:45,828 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:16:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2003591993, now seen corresponding path program 3 times [2025-03-13 22:16:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889553906] [2025-03-13 22:16:45,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:45,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 4 equivalence classes. [2025-03-13 22:16:45,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:45,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 22:16:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:50,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889553906] [2025-03-13 22:16:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889553906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099313171] [2025-03-13 22:16:50,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:50,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:50,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:50,433 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-13 22:16:50,434 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-13 22:16:50,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 4 equivalence classes. [2025-03-13 22:16:57,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:16:57,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-13 22:16:57,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:58,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-13 22:16:58,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:58,056 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-13 22:16:58,203 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-13 22:16:58,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:16:58,247 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-13 22:16:58,410 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 16 treesize of output 11 [2025-03-13 22:16:58,452 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 16 treesize of output 11 [2025-03-13 22:16:58,498 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 16 treesize of output 11 [2025-03-13 22:16:58,711 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-13 22:16:58,747 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 19 treesize of output 18 [2025-03-13 22:16:58,786 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 26 treesize of output 28 [2025-03-13 22:16:58,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-13 22:16:58,885 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 30 treesize of output 21 [2025-03-13 22:16:58,895 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 30 treesize of output 21 [2025-03-13 22:16:58,905 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 30 treesize of output 21 [2025-03-13 22:16:58,915 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 30 treesize of output 21 [2025-03-13 22:16:58,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:58,962 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-13 22:16:59,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:59,003 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-13 22:16:59,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:59,014 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 40 treesize of output 48 [2025-03-13 22:16:59,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:59,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-03-13 22:16:59,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:59,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 61 [2025-03-13 22:16:59,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:16:59,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 54 [2025-03-13 22:16:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:16:59,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:00,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) (.cse4 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store .cse0 |t_funThread1of1ForFork0_#t~mem33.base| (store (select .cse0 |t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| 0)))) (let ((.cse1 (store (select .cse2 c_~B~0.base) .cse4 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store .cse2 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse4) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse7 (store .cse5 |t_funThread1of1ForFork0_#t~mem33.base| (store (select .cse5 |t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| 0)))) (let ((.cse6 (store (select .cse7 c_~B~0.base) .cse4 0))) (store (store .cse5 c_~B~0.base .cse6) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store .cse7 c_~B~0.base .cse6) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_#t~mem33.base| (store (select .cse8 |t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| 0)))) (let ((.cse9 (store (select .cse10 c_~B~0.base) .cse4 0))) (store (store .cse8 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store .cse10 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse11 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse13 (store .cse11 |t_funThread1of1ForFork0_#t~mem33.base| (store (select .cse11 |t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| 0)))) (let ((.cse12 (store (select .cse13 c_~B~0.base) .cse4 0))) (store (store .cse11 c_~B~0.base .cse12) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store .cse13 c_~B~0.base .cse12) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)))) is different from false [2025-03-13 22:17:00,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 6 c_~B~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse3 (+ 3 .cse4)) (.cse6 (+ 7 c_~B~0.offset)) (.cse7 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse16 0)))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse5 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store (select .cse5 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse1 (store (select (store .cse5 |t_funThread1of1ForFork0_#t~mem33.base| .cse2) c_~B~0.base) .cse6 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse0 |t_funThread1of1ForFork0_#t~mem33.base| .cse2) c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse6) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse11 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse10 (store (select .cse11 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse9 (store (select (store .cse11 |t_funThread1of1ForFork0_#t~mem33.base| .cse10) c_~B~0.base) .cse6 0))) (store (store .cse8 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse8 |t_funThread1of1ForFork0_#t~mem33.base| .cse10) c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse15 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse14 (store (select .cse15 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse12 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse13 (store (select (store .cse15 |t_funThread1of1ForFork0_#t~mem33.base| .cse14) c_~B~0.base) .cse6 0))) (store (store .cse12 c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse12 |t_funThread1of1ForFork0_#t~mem33.base| .cse14) c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse16) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse20 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse19 (store (select .cse20 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse17 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse18 (store (select (store .cse20 |t_funThread1of1ForFork0_#t~mem33.base| .cse19) c_~B~0.base) .cse6 0))) (store (store .cse17 c_~B~0.base .cse18) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse17 |t_funThread1of1ForFork0_#t~mem33.base| .cse19) c_~B~0.base .cse18) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-03-13 22:17:00,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 5 c_~B~0.offset)) (.cse12 (+ 6 c_~B~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse3 (+ 3 .cse4)) (.cse7 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse17 0) .cse12 0))) (.cse6 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse5 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store (select .cse5 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse1 (store (select (store .cse5 |t_funThread1of1ForFork0_#t~mem33.base| .cse2) c_~B~0.base) .cse6 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse0 |t_funThread1of1ForFork0_#t~mem33.base| .cse2) c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse11 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse10 (store (select .cse11 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse9 (store (select (store .cse11 |t_funThread1of1ForFork0_#t~mem33.base| .cse10) c_~B~0.base) .cse6 0))) (store (store .cse8 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse8 |t_funThread1of1ForFork0_#t~mem33.base| .cse10) c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse12) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse16 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse15 (store (select .cse16 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse13 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse14 (store (select (store .cse16 |t_funThread1of1ForFork0_#t~mem33.base| .cse15) c_~B~0.base) .cse6 0))) (store (store .cse13 c_~B~0.base .cse14) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse13 |t_funThread1of1ForFork0_#t~mem33.base| .cse15) c_~B~0.base .cse14) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse17) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (|t_funThread1of1ForFork0_#t~mem33.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3121 Int)) (= (select (select (let ((.cse21 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse20 (store (select .cse21 |t_funThread1of1ForFork0_#t~mem33.base|) .cse4 0))) (let ((.cse18 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse19 (store (select (store .cse21 |t_funThread1of1ForFork0_#t~mem33.base| .cse20) c_~B~0.base) .cse6 0))) (store (store .cse18 c_~B~0.base .cse19) |t_funThread1of1ForFork0_#t~mem33.base| (store (store (select (store (store .cse18 |t_funThread1of1ForFork0_#t~mem33.base| .cse20) c_~B~0.base .cse19) |t_funThread1of1ForFork0_#t~mem33.base|) .cse3 v_ArrVal_3121) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse6) 0))))) is different from false [2025-03-13 22:17:00,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,714 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 3 case distinctions, treesize of input 235 treesize of output 165 [2025-03-13 22:17:00,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 544 treesize of output 530 [2025-03-13 22:17:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 310 [2025-03-13 22:17:00,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-13 22:17:00,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 374 treesize of output 354 [2025-03-13 22:17:00,888 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 135 [2025-03-13 22:17:00,898 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 65 treesize of output 57 [2025-03-13 22:17:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2025-03-13 22:17:00,911 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 165 [2025-03-13 22:17:00,926 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:00,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 286 treesize of output 272 [2025-03-13 22:17:00,940 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2025-03-13 22:17:00,945 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:00,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 235 treesize of output 165 [2025-03-13 22:17:00,961 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:00,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:17:00,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 286 treesize of output 272 [2025-03-13 22:17:00,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 218 [2025-03-13 22:17:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:17:03,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099313171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:03,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:03,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 19] total 62 [2025-03-13 22:17:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921283642] [2025-03-13 22:17:03,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:03,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-13 22:17:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-13 22:17:03,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3261, Unknown=34, NotChecked=354, Total=3906 [2025-03-13 22:17:04,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-13 22:17:04,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 780 transitions, 7512 flow. Second operand has 63 states, 63 states have (on average 112.0952380952381) internal successors, (7062), 63 states have internal predecessors, (7062), 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-13 22:17:04,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:04,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-13 22:17:04,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:15,202 INFO L124 PetriNetUnfolderBase]: 4019/11160 cut-off events. [2025-03-13 22:17:15,203 INFO L125 PetriNetUnfolderBase]: For 43337/43364 co-relation queries the response was YES. [2025-03-13 22:17:15,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45150 conditions, 11160 events. 4019/11160 cut-off events. For 43337/43364 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 99741 event pairs, 749 based on Foata normal form. 17/11054 useless extension candidates. Maximal degree in co-relation 44989. Up to 2673 conditions per place. [2025-03-13 22:17:15,332 INFO L140 encePairwiseOnDemand]: 229/276 looper letters, 935 selfloop transitions, 282 changer transitions 20/1334 dead transitions. [2025-03-13 22:17:15,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1334 transitions, 14420 flow [2025-03-13 22:17:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-13 22:17:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-13 22:17:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4814 transitions. [2025-03-13 22:17:15,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4360507246376812 [2025-03-13 22:17:15,338 INFO L175 Difference]: Start difference. First operand has 413 places, 780 transitions, 7512 flow. Second operand 40 states and 4814 transitions. [2025-03-13 22:17:15,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1334 transitions, 14420 flow [2025-03-13 22:17:15,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 1334 transitions, 14262 flow, removed 43 selfloop flow, removed 13 redundant places. [2025-03-13 22:17:15,602 INFO L231 Difference]: Finished difference. Result has 459 places, 891 transitions, 10024 flow [2025-03-13 22:17:15,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7386, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=10024, PETRI_PLACES=459, PETRI_TRANSITIONS=891} [2025-03-13 22:17:15,603 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 180 predicate places. [2025-03-13 22:17:15,603 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 891 transitions, 10024 flow [2025-03-13 22:17:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 112.0952380952381) internal successors, (7062), 63 states have internal predecessors, (7062), 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-13 22:17:15,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:15,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:15,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:15,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:15,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:17:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -297584129, now seen corresponding path program 4 times [2025-03-13 22:17:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842889441] [2025-03-13 22:17:15,812 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:17:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:15,836 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-13 22:17:15,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-03-13 22:17:15,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:17:15,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:17:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842889441] [2025-03-13 22:17:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842889441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921112626] [2025-03-13 22:17:16,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:17:16,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:16,819 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-13 22:17:16,821 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-13 22:17:16,990 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 188 statements into 2 equivalence classes. [2025-03-13 22:17:17,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 182 of 188 statements. [2025-03-13 22:17:17,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 22:17:17,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-13 22:17:17,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:17,058 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-13 22:17:17,082 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-13 22:17:17,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-13 22:17:17,156 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 19 treesize of output 1 [2025-03-13 22:17:17,187 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-13 22:17:17,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-13 22:17:17,251 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 14 [2025-03-13 22:17:17,276 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 14 [2025-03-13 22:17:17,305 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 14 [2025-03-13 22:17:17,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-13 22:17:17,403 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-13 22:17:17,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-13 22:17:17,433 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 27 treesize of output 20 [2025-03-13 22:17:17,439 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 27 treesize of output 20 [2025-03-13 22:17:17,451 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 27 treesize of output 20 [2025-03-13 22:17:17,458 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 27 treesize of output 20 [2025-03-13 22:17:17,471 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 27 treesize of output 20 [2025-03-13 22:17:17,478 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 27 treesize of output 20 [2025-03-13 22:17:17,485 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 27 treesize of output 20 [2025-03-13 22:17:17,492 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 27 treesize of output 20 [2025-03-13 22:17:17,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:17,506 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-13 22:17:17,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:17,518 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-13 22:17:17,541 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-13 22:17:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:17:17,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:17,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (and (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0))))) is different from false [2025-03-13 22:17:17,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_~B~0.offset)) (.cse1 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse0) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2025-03-13 22:17:17,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse0 c_~B~0.base (store (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse3 c_~B~0.base (store (store (select (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse4 c_~B~0.base (store (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3485))) (store .cse5 c_~B~0.base (store (store (select (store .cse5 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3489) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3493) c_~B~0.base) .cse2) 0)))) is different from false [2025-03-13 22:17:17,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse4 0))) (.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3485 (Array Int Int)) (v_ArrVal_3489 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_3485) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_3485) .cse1 v_ArrVal_3489) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_3493) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-13 22:17:17,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:17:17,885 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 2 case distinctions, treesize of input 65 treesize of output 70 [2025-03-13 22:17:17,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2025-03-13 22:17:17,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-13 22:17:17,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:17,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:17,899 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-03-13 22:17:17,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2025-03-13 22:17:17,900 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:17,900 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:17,901 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:17,901 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:17:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:17:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921112626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:18,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 32 [2025-03-13 22:17:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505179304] [2025-03-13 22:17:18,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-13 22:17:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:18,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-13 22:17:18,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=679, Unknown=54, NotChecked=228, Total=1056 [2025-03-13 22:17:18,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2025-03-13 22:17:18,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 891 transitions, 10024 flow. Second operand has 33 states, 33 states have (on average 114.24242424242425) internal successors, (3770), 33 states have internal predecessors, (3770), 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-13 22:17:18,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:18,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2025-03-13 22:17:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:24,163 INFO L124 PetriNetUnfolderBase]: 4507/12620 cut-off events. [2025-03-13 22:17:24,163 INFO L125 PetriNetUnfolderBase]: For 63565/63602 co-relation queries the response was YES. [2025-03-13 22:17:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54113 conditions, 12620 events. 4507/12620 cut-off events. For 63565/63602 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 116365 event pairs, 829 based on Foata normal form. 17/12485 useless extension candidates. Maximal degree in co-relation 53930. Up to 3337 conditions per place. [2025-03-13 22:17:24,265 INFO L140 encePairwiseOnDemand]: 243/276 looper letters, 942 selfloop transitions, 234 changer transitions 13/1290 dead transitions. [2025-03-13 22:17:24,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1290 transitions, 16323 flow [2025-03-13 22:17:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 22:17:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 22:17:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3217 transitions. [2025-03-13 22:17:24,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4482998885172798 [2025-03-13 22:17:24,269 INFO L175 Difference]: Start difference. First operand has 459 places, 891 transitions, 10024 flow. Second operand 26 states and 3217 transitions. [2025-03-13 22:17:24,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1290 transitions, 16323 flow [2025-03-13 22:17:24,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 1290 transitions, 16187 flow, removed 22 selfloop flow, removed 17 redundant places. [2025-03-13 22:17:24,670 INFO L231 Difference]: Finished difference. Result has 475 places, 974 transitions, 12273 flow [2025-03-13 22:17:24,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=9900, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12273, PETRI_PLACES=475, PETRI_TRANSITIONS=974} [2025-03-13 22:17:24,670 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 196 predicate places. [2025-03-13 22:17:24,671 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 974 transitions, 12273 flow [2025-03-13 22:17:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 114.24242424242425) internal successors, (3770), 33 states have internal predecessors, (3770), 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-13 22:17:24,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:24,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:24,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 22:17:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:24,872 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-13 22:17:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1645655947, now seen corresponding path program 5 times [2025-03-13 22:17:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916671170] [2025-03-13 22:17:24,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:17:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:24,900 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 5 equivalence classes. [2025-03-13 22:17:24,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:17:24,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-13 22:17:24,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:17:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916671170] [2025-03-13 22:17:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916671170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981382877] [2025-03-13 22:17:26,843 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:17:26,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:26,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:26,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:17:27,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 5 equivalence classes.