./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:42,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:42,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:42,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:42,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:42,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:42,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:42,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:42,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:42,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:42,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:42,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:42,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:42,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:42,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:42,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:42,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:42,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:42,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc [2025-03-04 06:45:42,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:42,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:42,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:42,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:42,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:42,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-03-04 06:45:43,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f00b3b/48ccce2353724ec6be4d63afda2c4311/FLAGf3ef6bbf2 [2025-03-04 06:45:44,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:44,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-03-04 06:45:44,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f00b3b/48ccce2353724ec6be4d63afda2c4311/FLAGf3ef6bbf2 [2025-03-04 06:45:44,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f00b3b/48ccce2353724ec6be4d63afda2c4311 [2025-03-04 06:45:44,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:44,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:44,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:44,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:44,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:44,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bee4615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44, skipping insertion in model container [2025-03-04 06:45:44,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:44,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:44,819 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:44,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:44,915 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:44,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44 WrapperNode [2025-03-04 06:45:44,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:44,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:44,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:44,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:44,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,957 INFO L138 Inliner]: procedures = 368, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2025-03-04 06:45:44,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:44,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:44,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:44,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:44,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:44,991 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:44,991 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:44,991 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:44,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (1/1) ... [2025-03-04 06:45:44,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:45,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:45:45,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:45:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:45:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:45,040 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:45,133 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:45,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:45,420 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:45,421 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:45,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:45,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:45,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:45 BoogieIcfgContainer [2025-03-04 06:45:45,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:45,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:45,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:45,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:45,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:44" (1/3) ... [2025-03-04 06:45:45,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc10fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:45, skipping insertion in model container [2025-03-04 06:45:45,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:44" (2/3) ... [2025-03-04 06:45:45,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc10fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:45, skipping insertion in model container [2025-03-04 06:45:45,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:45" (3/3) ... [2025-03-04 06:45:45,459 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2025-03-04 06:45:45,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:45,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_01-list_rc.i that has 2 procedures, 200 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-04 06:45:45,472 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:45,537 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:45,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 199 transitions, 402 flow [2025-03-04 06:45:45,645 INFO L124 PetriNetUnfolderBase]: 0/198 cut-off events. [2025-03-04 06:45:45,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 198 events. 0/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-04 06:45:45,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 199 transitions, 402 flow [2025-03-04 06:45:45,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 198 transitions, 399 flow [2025-03-04 06:45:45,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:45,677 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;@78a5eb86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:45,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:45:45,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:45,688 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-03-04 06:45:45,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:45,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:45,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:45,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1168016103, now seen corresponding path program 1 times [2025-03-04 06:45:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394004537] [2025-03-04 06:45:45,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:45,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:45:45,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:45:45,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:45,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394004537] [2025-03-04 06:45:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394004537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973374538] [2025-03-04 06:45:46,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:46,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:46,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:46,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-03-04 06:45:46,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:46,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:46,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-03-04 06:45:46,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:46,940 INFO L124 PetriNetUnfolderBase]: 220/1022 cut-off events. [2025-03-04 06:45:46,940 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:46,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1022 events. 220/1022 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5354 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-03-04 06:45:46,951 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-03-04 06:45:46,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 509 flow [2025-03-04 06:45:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-03-04 06:45:46,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-03-04 06:45:46,971 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 399 flow. Second operand 6 states and 899 transitions. [2025-03-04 06:45:46,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 509 flow [2025-03-04 06:45:46,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:46,981 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 414 flow [2025-03-04 06:45:46,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2025-03-04 06:45:46,988 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 2 predicate places. [2025-03-04 06:45:46,988 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 414 flow [2025-03-04 06:45:46,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:46,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:46,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:46,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:46,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:46,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 263384593, now seen corresponding path program 1 times [2025-03-04 06:45:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197672657] [2025-03-04 06:45:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:45:47,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:45:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197672657] [2025-03-04 06:45:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197672657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517972649] [2025-03-04 06:45:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:47,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:47,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:47,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:47,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-03-04 06:45:47,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:47,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:47,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-03-04 06:45:47,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:47,801 INFO L124 PetriNetUnfolderBase]: 220/1020 cut-off events. [2025-03-04 06:45:47,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:47,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 1020 events. 220/1020 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5393 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-03-04 06:45:47,809 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-03-04 06:45:47,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 524 flow [2025-03-04 06:45:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-03-04 06:45:47,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-03-04 06:45:47,813 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 414 flow. Second operand 6 states and 899 transitions. [2025-03-04 06:45:47,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 524 flow [2025-03-04 06:45:47,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 504 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:47,818 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-03-04 06:45:47,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-03-04 06:45:47,820 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 0 predicate places. [2025-03-04 06:45:47,820 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-03-04 06:45:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:47,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:47,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:47,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:45:47,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:47,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1200784107, now seen corresponding path program 1 times [2025-03-04 06:45:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532939104] [2025-03-04 06:45:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:45:47,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:45:47,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:47,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532939104] [2025-03-04 06:45:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532939104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021616629] [2025-03-04 06:45:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:47,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:47,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 199 [2025-03-04 06:45:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:47,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:47,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 199 [2025-03-04 06:45:47,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:47,959 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-03-04 06:45:47,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:47,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 329 events. 16/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 774 event pairs, 16 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-03-04 06:45:47,962 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 14 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-03-04 06:45:47,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 193 transitions, 440 flow [2025-03-04 06:45:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-03-04 06:45:47,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430485762144054 [2025-03-04 06:45:47,965 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 563 transitions. [2025-03-04 06:45:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 193 transitions, 440 flow [2025-03-04 06:45:47,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:47,969 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 392 flow [2025-03-04 06:45:47,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2025-03-04 06:45:47,971 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -4 predicate places. [2025-03-04 06:45:47,971 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 392 flow [2025-03-04 06:45:47,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:47,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:47,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:47,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1662515571, now seen corresponding path program 1 times [2025-03-04 06:45:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61234957] [2025-03-04 06:45:47,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:45:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:45:47,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61234957] [2025-03-04 06:45:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61234957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:45:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587821287] [2025-03-04 06:45:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:48,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:48,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:48,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:48,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 199 [2025-03-04 06:45:48,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 193 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:48,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:48,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 199 [2025-03-04 06:45:48,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:48,092 INFO L124 PetriNetUnfolderBase]: 24/406 cut-off events. [2025-03-04 06:45:48,093 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 406 events. 24/406 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1214 event pairs, 24 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-03-04 06:45:48,095 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 15 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2025-03-04 06:45:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 414 flow [2025-03-04 06:45:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-04 06:45:48,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9296482412060302 [2025-03-04 06:45:48,099 INFO L175 Difference]: Start difference. First operand has 198 places, 193 transitions, 392 flow. Second operand 3 states and 555 transitions. [2025-03-04 06:45:48,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 414 flow [2025-03-04 06:45:48,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 188 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:48,102 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 380 flow [2025-03-04 06:45:48,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2025-03-04 06:45:48,104 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -9 predicate places. [2025-03-04 06:45:48,104 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 380 flow [2025-03-04 06:45:48,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:48,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:48,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:45:48,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 228672606, now seen corresponding path program 1 times [2025-03-04 06:45:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643684734] [2025-03-04 06:45:48,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:48,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:45:48,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:45:48,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:48,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643684734] [2025-03-04 06:45:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643684734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277261703] [2025-03-04 06:45:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:48,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:48,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:48,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:48,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 199 [2025-03-04 06:45:48,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:48,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:48,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 199 [2025-03-04 06:45:48,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:48,908 INFO L124 PetriNetUnfolderBase]: 288/1159 cut-off events. [2025-03-04 06:45:48,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:48,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1159 events. 288/1159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6223 event pairs, 288 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-03-04 06:45:48,914 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 58 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-04 06:45:48,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 187 transitions, 504 flow [2025-03-04 06:45:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-04 06:45:48,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7319932998324958 [2025-03-04 06:45:48,917 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 380 flow. Second operand 6 states and 874 transitions. [2025-03-04 06:45:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 187 transitions, 504 flow [2025-03-04 06:45:48,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:48,921 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 387 flow [2025-03-04 06:45:48,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-03-04 06:45:48,922 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -6 predicate places. [2025-03-04 06:45:48,923 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 387 flow [2025-03-04 06:45:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:48,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:48,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:48,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -829438370, now seen corresponding path program 1 times [2025-03-04 06:45:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39374077] [2025-03-04 06:45:48,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:48,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:45:48,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:45:48,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:48,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39374077] [2025-03-04 06:45:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39374077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331597872] [2025-03-04 06:45:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:49,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:49,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:49,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2025-03-04 06:45:49,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:49,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:49,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2025-03-04 06:45:49,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:49,914 INFO L124 PetriNetUnfolderBase]: 316/1485 cut-off events. [2025-03-04 06:45:49,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:49,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1485 events. 316/1485 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9163 event pairs, 36 based on Foata normal form. 0/1395 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-03-04 06:45:49,921 INFO L140 encePairwiseOnDemand]: 171/199 looper letters, 99 selfloop transitions, 70 changer transitions 0/299 dead transitions. [2025-03-04 06:45:49,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 299 transitions, 949 flow [2025-03-04 06:45:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2025-03-04 06:45:49,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567839195979899 [2025-03-04 06:45:49,925 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 387 flow. Second operand 6 states and 1023 transitions. [2025-03-04 06:45:49,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 299 transitions, 949 flow [2025-03-04 06:45:49,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 299 transitions, 939 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:49,932 INFO L231 Difference]: Finished difference. Result has 200 places, 257 transitions, 855 flow [2025-03-04 06:45:49,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=200, PETRI_TRANSITIONS=257} [2025-03-04 06:45:49,934 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -2 predicate places. [2025-03-04 06:45:49,935 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 257 transitions, 855 flow [2025-03-04 06:45:49,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:49,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:49,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:49,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:45:49,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:49,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1417847922, now seen corresponding path program 1 times [2025-03-04 06:45:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740425129] [2025-03-04 06:45:49,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:49,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 06:45:49,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 06:45:49,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:49,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740425129] [2025-03-04 06:45:50,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740425129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216933515] [2025-03-04 06:45:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:50,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2025-03-04 06:45:50,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 257 transitions, 855 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:50,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:50,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2025-03-04 06:45:50,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:50,762 INFO L124 PetriNetUnfolderBase]: 588/2256 cut-off events. [2025-03-04 06:45:50,762 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-03-04 06:45:50,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2256 events. 588/2256 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15100 event pairs, 222 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-03-04 06:45:50,773 INFO L140 encePairwiseOnDemand]: 184/199 looper letters, 106 selfloop transitions, 48 changer transitions 0/308 dead transitions. [2025-03-04 06:45:50,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 308 transitions, 1335 flow [2025-03-04 06:45:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-03-04 06:45:50,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2025-03-04 06:45:50,776 INFO L175 Difference]: Start difference. First operand has 200 places, 257 transitions, 855 flow. Second operand 6 states and 960 transitions. [2025-03-04 06:45:50,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 308 transitions, 1335 flow [2025-03-04 06:45:50,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 308 transitions, 1335 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:50,785 INFO L231 Difference]: Finished difference. Result has 210 places, 300 transitions, 1243 flow [2025-03-04 06:45:50,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1243, PETRI_PLACES=210, PETRI_TRANSITIONS=300} [2025-03-04 06:45:50,787 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2025-03-04 06:45:50,787 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 300 transitions, 1243 flow [2025-03-04 06:45:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:50,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:50,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:45:50,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2093105741, now seen corresponding path program 1 times [2025-03-04 06:45:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859516520] [2025-03-04 06:45:50,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:50,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:45:50,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:45:50,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:50,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859516520] [2025-03-04 06:45:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859516520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735080051] [2025-03-04 06:45:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:51,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:51,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:51,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:51,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2025-03-04 06:45:51,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 300 transitions, 1243 flow. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:51,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:51,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2025-03-04 06:45:51,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,751 INFO L124 PetriNetUnfolderBase]: 752/2809 cut-off events. [2025-03-04 06:45:51,751 INFO L125 PetriNetUnfolderBase]: For 1634/1691 co-relation queries the response was YES. [2025-03-04 06:45:51,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2809 events. 752/2809 cut-off events. For 1634/1691 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20081 event pairs, 86 based on Foata normal form. 0/2713 useless extension candidates. Maximal degree in co-relation 6514. Up to 1022 conditions per place. [2025-03-04 06:45:51,763 INFO L140 encePairwiseOnDemand]: 176/199 looper letters, 128 selfloop transitions, 136 changer transitions 4/440 dead transitions. [2025-03-04 06:45:51,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 440 transitions, 2535 flow [2025-03-04 06:45:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2025-03-04 06:45:51,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8525963149078727 [2025-03-04 06:45:51,766 INFO L175 Difference]: Start difference. First operand has 210 places, 300 transitions, 1243 flow. Second operand 6 states and 1018 transitions. [2025-03-04 06:45:51,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 440 transitions, 2535 flow [2025-03-04 06:45:51,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 440 transitions, 2517 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:51,778 INFO L231 Difference]: Finished difference. Result has 220 places, 431 transitions, 2591 flow [2025-03-04 06:45:51,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=220, PETRI_TRANSITIONS=431} [2025-03-04 06:45:51,779 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 18 predicate places. [2025-03-04 06:45:51,779 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 431 transitions, 2591 flow [2025-03-04 06:45:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:51,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:51,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:51,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:45:51,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1407604520, now seen corresponding path program 1 times [2025-03-04 06:45:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328765202] [2025-03-04 06:45:51,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:51,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:45:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:45:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328765202] [2025-03-04 06:45:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328765202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:45:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246453887] [2025-03-04 06:45:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:52,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:45:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:45:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:45:53,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-04 06:45:53,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 431 transitions, 2591 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:53,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:53,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-04 06:45:53,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:54,426 INFO L124 PetriNetUnfolderBase]: 1151/4146 cut-off events. [2025-03-04 06:45:54,426 INFO L125 PetriNetUnfolderBase]: For 5344/5448 co-relation queries the response was YES. [2025-03-04 06:45:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 4146 events. 1151/4146 cut-off events. For 5344/5448 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33231 event pairs, 94 based on Foata normal form. 35/4083 useless extension candidates. Maximal degree in co-relation 11828. Up to 880 conditions per place. [2025-03-04 06:45:54,452 INFO L140 encePairwiseOnDemand]: 162/199 looper letters, 349 selfloop transitions, 159 changer transitions 4/655 dead transitions. [2025-03-04 06:45:54,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 655 transitions, 5031 flow [2025-03-04 06:45:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:45:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 06:45:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2077 transitions. [2025-03-04 06:45:54,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7455132806891601 [2025-03-04 06:45:54,456 INFO L175 Difference]: Start difference. First operand has 220 places, 431 transitions, 2591 flow. Second operand 14 states and 2077 transitions. [2025-03-04 06:45:54,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 655 transitions, 5031 flow [2025-03-04 06:45:54,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 655 transitions, 4959 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:54,486 INFO L231 Difference]: Finished difference. Result has 243 places, 494 transitions, 3864 flow [2025-03-04 06:45:54,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3864, PETRI_PLACES=243, PETRI_TRANSITIONS=494} [2025-03-04 06:45:54,487 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 41 predicate places. [2025-03-04 06:45:54,487 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 494 transitions, 3864 flow [2025-03-04 06:45:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:54,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:54,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:54,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:45:54,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -152946728, now seen corresponding path program 2 times [2025-03-04 06:45:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283370544] [2025-03-04 06:45:54,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:54,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:45:54,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:45:54,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:54,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283370544] [2025-03-04 06:45:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283370544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:54,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:45:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384745681] [2025-03-04 06:45:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:45:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:54,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:45:54,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:45:55,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-04 06:45:55,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 494 transitions, 3864 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:55,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:55,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-04 06:45:55,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:56,901 INFO L124 PetriNetUnfolderBase]: 1262/4509 cut-off events. [2025-03-04 06:45:56,901 INFO L125 PetriNetUnfolderBase]: For 9526/9629 co-relation queries the response was YES. [2025-03-04 06:45:56,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14412 conditions, 4509 events. 1262/4509 cut-off events. For 9526/9629 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 36349 event pairs, 93 based on Foata normal form. 39/4426 useless extension candidates. Maximal degree in co-relation 14314. Up to 891 conditions per place. [2025-03-04 06:45:56,939 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 440 selfloop transitions, 103 changer transitions 0/686 dead transitions. [2025-03-04 06:45:56,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 686 transitions, 6408 flow [2025-03-04 06:45:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 06:45:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 06:45:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2654 transitions. [2025-03-04 06:45:56,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.701930706162391 [2025-03-04 06:45:56,944 INFO L175 Difference]: Start difference. First operand has 243 places, 494 transitions, 3864 flow. Second operand 19 states and 2654 transitions. [2025-03-04 06:45:56,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 686 transitions, 6408 flow [2025-03-04 06:45:56,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 686 transitions, 6403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:45:56,985 INFO L231 Difference]: Finished difference. Result has 267 places, 549 transitions, 4679 flow [2025-03-04 06:45:56,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4679, PETRI_PLACES=267, PETRI_TRANSITIONS=549} [2025-03-04 06:45:56,987 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 65 predicate places. [2025-03-04 06:45:56,987 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 549 transitions, 4679 flow [2025-03-04 06:45:56,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:56,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:56,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:45:56,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -891793542, now seen corresponding path program 3 times [2025-03-04 06:45:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269179236] [2025-03-04 06:45:56,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:45:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:57,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:45:57,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:45:57,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:45:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269179236] [2025-03-04 06:45:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269179236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:57,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:45:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949661100] [2025-03-04 06:45:57,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:57,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:45:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:57,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:45:57,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:45:58,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-04 06:45:58,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 549 transitions, 4679 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:58,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:58,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-04 06:45:58,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:59,397 INFO L124 PetriNetUnfolderBase]: 1753/6359 cut-off events. [2025-03-04 06:45:59,397 INFO L125 PetriNetUnfolderBase]: For 18300/18512 co-relation queries the response was YES. [2025-03-04 06:45:59,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21512 conditions, 6359 events. 1753/6359 cut-off events. For 18300/18512 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 58102 event pairs, 172 based on Foata normal form. 45/6245 useless extension candidates. Maximal degree in co-relation 21404. Up to 1877 conditions per place. [2025-03-04 06:45:59,439 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 417 selfloop transitions, 204 changer transitions 1/765 dead transitions. [2025-03-04 06:45:59,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 765 transitions, 8082 flow [2025-03-04 06:45:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:45:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:45:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2111 transitions. [2025-03-04 06:45:59,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7072026800670017 [2025-03-04 06:45:59,444 INFO L175 Difference]: Start difference. First operand has 267 places, 549 transitions, 4679 flow. Second operand 15 states and 2111 transitions. [2025-03-04 06:45:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 765 transitions, 8082 flow [2025-03-04 06:45:59,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 765 transitions, 8041 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:59,501 INFO L231 Difference]: Finished difference. Result has 286 places, 653 transitions, 6958 flow [2025-03-04 06:45:59,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6958, PETRI_PLACES=286, PETRI_TRANSITIONS=653} [2025-03-04 06:45:59,502 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 84 predicate places. [2025-03-04 06:45:59,502 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 653 transitions, 6958 flow [2025-03-04 06:45:59,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:59,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:59,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:59,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:45:59,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:45:59,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -475010838, now seen corresponding path program 4 times [2025-03-04 06:45:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313951546] [2025-03-04 06:45:59,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:45:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:59,522 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:45:59,531 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 114 statements. [2025-03-04 06:45:59,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:45:59,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313951546] [2025-03-04 06:45:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313951546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 06:45:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081379045] [2025-03-04 06:45:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:45:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:59,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:45:59,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:46:00,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-04 06:46:00,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 653 transitions, 6958 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:00,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:00,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-04 06:46:00,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:02,672 INFO L124 PetriNetUnfolderBase]: 2409/8639 cut-off events. [2025-03-04 06:46:02,672 INFO L125 PetriNetUnfolderBase]: For 36231/36531 co-relation queries the response was YES. [2025-03-04 06:46:02,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31316 conditions, 8639 events. 2409/8639 cut-off events. For 36231/36531 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 85230 event pairs, 231 based on Foata normal form. 82/8520 useless extension candidates. Maximal degree in co-relation 31197. Up to 1704 conditions per place. [2025-03-04 06:46:02,725 INFO L140 encePairwiseOnDemand]: 164/199 looper letters, 511 selfloop transitions, 329 changer transitions 2/985 dead transitions. [2025-03-04 06:46:02,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 985 transitions, 12297 flow [2025-03-04 06:46:02,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 06:46:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 06:46:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2718 transitions. [2025-03-04 06:46:02,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7188574451203386 [2025-03-04 06:46:02,730 INFO L175 Difference]: Start difference. First operand has 286 places, 653 transitions, 6958 flow. Second operand 19 states and 2718 transitions. [2025-03-04 06:46:02,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 985 transitions, 12297 flow [2025-03-04 06:46:02,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 985 transitions, 12270 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 06:46:02,860 INFO L231 Difference]: Finished difference. Result has 316 places, 787 transitions, 10473 flow [2025-03-04 06:46:02,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=6931, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10473, PETRI_PLACES=316, PETRI_TRANSITIONS=787} [2025-03-04 06:46:02,861 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 114 predicate places. [2025-03-04 06:46:02,863 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 787 transitions, 10473 flow [2025-03-04 06:46:02,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:02,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:02,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:02,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:46:02,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:46:02,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1027445459, now seen corresponding path program 1 times [2025-03-04 06:46:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965445911] [2025-03-04 06:46:02,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:02,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:46:02,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:02,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:02,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:03,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:03,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965445911] [2025-03-04 06:46:03,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965445911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:03,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997817566] [2025-03-04 06:46:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:03,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:03,289 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-04 06:46:03,290 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-04 06:46:03,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:46:03,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:03,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 06:46:03,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:03,469 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-04 06:46:03,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:03,538 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-04 06:46:03,561 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-04 06:46:03,568 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-04 06:46:03,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:03,585 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-04 06:46:03,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:03,600 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-04 06:46:03,621 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-04 06:46:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:03,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:03,658 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))))) is different from false [2025-03-04 06:46:03,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2))))))) is different from false [2025-03-04 06:46:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997817566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:07,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-04 06:46:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288958743] [2025-03-04 06:46:07,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:46:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:07,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:46:07,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=9, NotChecked=58, Total=306 [2025-03-04 06:46:07,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 199 [2025-03-04 06:46:07,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 787 transitions, 10473 flow. Second operand has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:07,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:07,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 199 [2025-03-04 06:46:07,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:10,847 INFO L124 PetriNetUnfolderBase]: 4686/13068 cut-off events. [2025-03-04 06:46:10,848 INFO L125 PetriNetUnfolderBase]: For 66182/66420 co-relation queries the response was YES. [2025-03-04 06:46:10,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 13068 events. 4686/13068 cut-off events. For 66182/66420 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 124123 event pairs, 1219 based on Foata normal form. 78/12818 useless extension candidates. Maximal degree in co-relation 51560. Up to 4099 conditions per place. [2025-03-04 06:46:10,967 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 724 selfloop transitions, 179 changer transitions 0/990 dead transitions. [2025-03-04 06:46:10,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 990 transitions, 14575 flow [2025-03-04 06:46:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 06:46:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 06:46:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1559 transitions. [2025-03-04 06:46:10,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595836324479541 [2025-03-04 06:46:10,970 INFO L175 Difference]: Start difference. First operand has 316 places, 787 transitions, 10473 flow. Second operand 14 states and 1559 transitions. [2025-03-04 06:46:10,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 990 transitions, 14575 flow [2025-03-04 06:46:11,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 990 transitions, 14492 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-03-04 06:46:11,209 INFO L231 Difference]: Finished difference. Result has 331 places, 802 transitions, 11222 flow [2025-03-04 06:46:11,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=10406, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11222, PETRI_PLACES=331, PETRI_TRANSITIONS=802} [2025-03-04 06:46:11,209 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 129 predicate places. [2025-03-04 06:46:11,209 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 802 transitions, 11222 flow [2025-03-04 06:46:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:11,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:11,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:11,217 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-04 06:46:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:46:11,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:46:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2089144658, now seen corresponding path program 5 times [2025-03-04 06:46:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827289522] [2025-03-04 06:46:11,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:46:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:11,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:46:11,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:11,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:46:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827289522] [2025-03-04 06:46:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827289522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470119483] [2025-03-04 06:46:12,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:46:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:12,021 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-04 06:46:12,022 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-04 06:46:12,126 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:46:12,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:12,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:46:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:12,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 06:46:12,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:12,337 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-04 06:46:12,363 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-04 06:46:12,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:12,393 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-04 06:46:12,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:12,424 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-04 06:46:12,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:12,568 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-04 06:46:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:12,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470119483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:13,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-03-04 06:46:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344929266] [2025-03-04 06:46:13,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:13,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 06:46:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 06:46:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 06:46:27,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 199 [2025-03-04 06:46:27,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 802 transitions, 11222 flow. Second operand has 35 states, 35 states have (on average 129.0857142857143) internal successors, (4518), 35 states have internal predecessors, (4518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:27,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:27,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 199 [2025-03-04 06:46:27,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:30,795 INFO L124 PetriNetUnfolderBase]: 3278/11720 cut-off events. [2025-03-04 06:46:30,796 INFO L125 PetriNetUnfolderBase]: For 75027/75582 co-relation queries the response was YES. [2025-03-04 06:46:30,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48221 conditions, 11720 events. 3278/11720 cut-off events. For 75027/75582 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 124922 event pairs, 314 based on Foata normal form. 126/11555 useless extension candidates. Maximal degree in co-relation 48078. Up to 2369 conditions per place. [2025-03-04 06:46:30,891 INFO L140 encePairwiseOnDemand]: 163/199 looper letters, 550 selfloop transitions, 407 changer transitions 3/1105 dead transitions. [2025-03-04 06:46:30,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1105 transitions, 17117 flow [2025-03-04 06:46:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 06:46:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 06:46:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3036 transitions. [2025-03-04 06:46:30,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6934673366834171 [2025-03-04 06:46:30,894 INFO L175 Difference]: Start difference. First operand has 331 places, 802 transitions, 11222 flow. Second operand 22 states and 3036 transitions. [2025-03-04 06:46:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1105 transitions, 17117 flow [2025-03-04 06:46:31,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1105 transitions, 16930 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:46:31,120 INFO L231 Difference]: Finished difference. Result has 355 places, 918 transitions, 15168 flow [2025-03-04 06:46:31,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=11098, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15168, PETRI_PLACES=355, PETRI_TRANSITIONS=918} [2025-03-04 06:46:31,121 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 153 predicate places. [2025-03-04 06:46:31,121 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 918 transitions, 15168 flow [2025-03-04 06:46:31,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 129.0857142857143) internal successors, (4518), 35 states have internal predecessors, (4518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:31,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:31,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:31,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:46:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 06:46:31,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:46:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1159177822, now seen corresponding path program 6 times [2025-03-04 06:46:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795453793] [2025-03-04 06:46:31,325 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:46:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:31,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:46:31,347 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:31,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 06:46:31,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795453793] [2025-03-04 06:46:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795453793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320231371] [2025-03-04 06:46:31,775 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 06:46:31,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:31,778 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-04 06:46:31,785 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-04 06:46:31,902 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:46:32,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:32,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 06:46:32,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:32,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:46:32,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:32,028 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-04 06:46:32,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:32,170 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-04 06:46:32,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:46:32,289 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-04 06:46:32,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 06:46:32,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:46:32,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-03-04 06:46:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:32,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320231371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:33,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 06:46:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427648796] [2025-03-04 06:46:33,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:46:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:33,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:46:33,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:46:40,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-03-04 06:46:40,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 918 transitions, 15168 flow. Second operand has 34 states, 34 states have (on average 132.91176470588235) internal successors, (4519), 34 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:40,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:40,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-03-04 06:46:40,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:46,447 INFO L124 PetriNetUnfolderBase]: 4371/15380 cut-off events. [2025-03-04 06:46:46,447 INFO L125 PetriNetUnfolderBase]: For 123281/124122 co-relation queries the response was YES. [2025-03-04 06:46:46,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66726 conditions, 15380 events. 4371/15380 cut-off events. For 123281/124122 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 174169 event pairs, 242 based on Foata normal form. 247/15229 useless extension candidates. Maximal degree in co-relation 66573. Up to 3140 conditions per place. [2025-03-04 06:46:46,576 INFO L140 encePairwiseOnDemand]: 169/199 looper letters, 596 selfloop transitions, 494 changer transitions 0/1239 dead transitions. [2025-03-04 06:46:46,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 1239 transitions, 22496 flow [2025-03-04 06:46:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 06:46:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 06:46:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2809 transitions. [2025-03-04 06:46:46,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7057788944723619 [2025-03-04 06:46:46,578 INFO L175 Difference]: Start difference. First operand has 355 places, 918 transitions, 15168 flow. Second operand 20 states and 2809 transitions. [2025-03-04 06:46:46,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 1239 transitions, 22496 flow [2025-03-04 06:46:46,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1239 transitions, 22395 flow, removed 35 selfloop flow, removed 9 redundant places. [2025-03-04 06:46:46,930 INFO L231 Difference]: Finished difference. Result has 374 places, 1042 transitions, 20121 flow [2025-03-04 06:46:46,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=15113, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=20121, PETRI_PLACES=374, PETRI_TRANSITIONS=1042} [2025-03-04 06:46:46,930 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 172 predicate places. [2025-03-04 06:46:46,930 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 1042 transitions, 20121 flow [2025-03-04 06:46:46,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 132.91176470588235) internal successors, (4519), 34 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:46,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:46,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:46:46,942 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-04 06:46:47,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:47,132 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:46:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash -142065538, now seen corresponding path program 7 times [2025-03-04 06:46:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642613437] [2025-03-04 06:46:47,133 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 06:46:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:46:47,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:46:47,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:47,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:47,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:46:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642613437] [2025-03-04 06:46:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642613437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:46:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146551511] [2025-03-04 06:46:47,480 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 06:46:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:46:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:47,482 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-04 06:46:47,483 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-04 06:46:47,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:46:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:46:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:46:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:46:47,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 06:46:47,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:46:47,637 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-04 06:46:47,685 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:46:47,685 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-04 06:46:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:46:47,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 06:46:47,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:47,712 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-04 06:46:47,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:47,736 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-04 06:46:47,762 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-04 06:46:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:47,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:46:47,828 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-04 06:46:47,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0))))) is different from false [2025-03-04 06:46:47,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1605 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1605) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-03-04 06:46:51,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:51,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-04 06:46:51,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:46:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-03-04 06:46:51,591 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:51,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:51,594 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:51,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:51,597 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-04 06:46:51,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-04 06:46:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:46:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146551511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:46:51,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:46:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-04 06:46:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137407517] [2025-03-04 06:46:51,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:46:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 06:46:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:46:51,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 06:46:51,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=228, Unknown=35, NotChecked=102, Total=420 [2025-03-04 06:46:51,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 199 [2025-03-04 06:46:51,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1042 transitions, 20121 flow. Second operand has 21 states, 21 states have (on average 99.95238095238095) internal successors, (2099), 21 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:46:51,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:46:51,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 199 [2025-03-04 06:46:51,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:46:59,527 INFO L124 PetriNetUnfolderBase]: 9085/25123 cut-off events. [2025-03-04 06:46:59,527 INFO L125 PetriNetUnfolderBase]: For 215083/215878 co-relation queries the response was YES. [2025-03-04 06:46:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114651 conditions, 25123 events. 9085/25123 cut-off events. For 215083/215878 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 276298 event pairs, 2036 based on Foata normal form. 182/24554 useless extension candidates. Maximal degree in co-relation 114483. Up to 6653 conditions per place. [2025-03-04 06:46:59,872 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 899 selfloop transitions, 505 changer transitions 6/1501 dead transitions. [2025-03-04 06:46:59,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1501 transitions, 28451 flow [2025-03-04 06:46:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 06:46:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 06:46:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2525 transitions. [2025-03-04 06:46:59,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5767473732297853 [2025-03-04 06:46:59,874 INFO L175 Difference]: Start difference. First operand has 374 places, 1042 transitions, 20121 flow. Second operand 22 states and 2525 transitions. [2025-03-04 06:46:59,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1501 transitions, 28451 flow [2025-03-04 06:47:00,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1501 transitions, 28257 flow, removed 67 selfloop flow, removed 10 redundant places. [2025-03-04 06:47:00,679 INFO L231 Difference]: Finished difference. Result has 394 places, 1126 transitions, 24343 flow [2025-03-04 06:47:00,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=19941, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=423, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=24343, PETRI_PLACES=394, PETRI_TRANSITIONS=1126} [2025-03-04 06:47:00,680 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 192 predicate places. [2025-03-04 06:47:00,680 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 1126 transitions, 24343 flow [2025-03-04 06:47:00,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 99.95238095238095) internal successors, (2099), 21 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:00,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:00,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:00,688 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-04 06:47:00,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 06:47:00,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:47:00,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2031058796, now seen corresponding path program 8 times [2025-03-04 06:47:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547194023] [2025-03-04 06:47:00,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:00,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:47:00,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:47:00,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:47:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547194023] [2025-03-04 06:47:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547194023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890123532] [2025-03-04 06:47:01,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:01,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:01,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:01,222 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-04 06:47:01,223 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-04 06:47:01,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-04 06:47:01,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:47:01,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:47:01,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:01,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:47:01,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:01,458 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-04 06:47:01,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 06:47:01,601 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-04 06:47:01,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 06:47:01,677 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-04 06:47:01,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 06:47:01,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 06:47:01,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-03-04 06:47:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:01,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890123532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:03,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:03,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 06:47:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102635575] [2025-03-04 06:47:03,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:03,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:47:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:03,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:47:03,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122