./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.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 b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:29:31,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:29:31,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:29:31,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:29:31,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:29:31,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:29:31,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:29:31,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:29:31,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:29:31,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:29:31,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:29:31,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:29:31,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:29:31,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:29:31,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:29:31,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:31,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:29:31,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:29:31,536 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 -> b9f8638b837f9d4f066ca2de5a13579053f042517f09bc86f1b9882385463239 [2025-03-13 22:29:31,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:29:31,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:29:31,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:29:31,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:29:31,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:29:31,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2025-03-13 22:29:32,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418cdee1b/f95c32eb5f43400fb6f4ca818ab9cf80/FLAG25200aa3d [2025-03-13 22:29:33,197 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:29:33,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2025-03-13 22:29:33,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418cdee1b/f95c32eb5f43400fb6f4ca818ab9cf80/FLAG25200aa3d [2025-03-13 22:29:33,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418cdee1b/f95c32eb5f43400fb6f4ca818ab9cf80 [2025-03-13 22:29:33,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:29:33,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:29:33,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:33,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:29:33,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:29:33,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4919ae51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33, skipping insertion in model container [2025-03-13 22:29:33,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:29:33,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:33,749 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:29:33,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:33,824 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:29:33,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33 WrapperNode [2025-03-13 22:29:33,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:33,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:33,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:29:33,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:29:33,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,850 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-03-13 22:29:33,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:33,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:29:33,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:29:33,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:29:33,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:29:33,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:29:33,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:29:33,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:29:33,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (1/1) ... [2025-03-13 22:29:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:33,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:29:33,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:29:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:29:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:29:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:29:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:29:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:29:33,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:29:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:29:33,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:29:33,913 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:29:33,996 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:29:33,997 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:29:34,145 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:29:34,147 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:29:34,148 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:29:34,155 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:29:34,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:34 BoogieIcfgContainer [2025-03-13 22:29:34,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:29:34,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:29:34,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:29:34,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:29:34,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:29:33" (1/3) ... [2025-03-13 22:29:34,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad5780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:34, skipping insertion in model container [2025-03-13 22:29:34,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:33" (2/3) ... [2025-03-13 22:29:34,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad5780d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:34, skipping insertion in model container [2025-03-13 22:29:34,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:34" (3/3) ... [2025-03-13 22:29:34,163 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2025-03-13 22:29:34,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:29:34,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct.i that has 2 procedures, 81 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-13 22:29:34,175 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:29:34,224 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:29:34,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 173 flow [2025-03-13 22:29:34,294 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2025-03-13 22:29:34,297 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:29:34,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 2/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-03-13 22:29:34,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 83 transitions, 173 flow [2025-03-13 22:29:34,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 173 flow [2025-03-13 22:29:34,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:34,320 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;@7dec749c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:34,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 22:29:34,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:34,329 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-13 22:29:34,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:34,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:34,330 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] [2025-03-13 22:29:34,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:29:34,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1162077507, now seen corresponding path program 1 times [2025-03-13 22:29:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144281594] [2025-03-13 22:29:34,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:34,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:29:34,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:29:34,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144281594] [2025-03-13 22:29:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144281594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078910907] [2025-03-13 22:29:34,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:34,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:34,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:34,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:34,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 83 [2025-03-13 22:29:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:34,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:34,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 83 [2025-03-13 22:29:34,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:34,840 INFO L124 PetriNetUnfolderBase]: 1/120 cut-off events. [2025-03-13 22:29:34,840 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:29:34,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 120 events. 1/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 22. Up to 16 conditions per place. [2025-03-13 22:29:34,841 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 11 selfloop transitions, 2 changer transitions 6/87 dead transitions. [2025-03-13 22:29:34,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 217 flow [2025-03-13 22:29:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2025-03-13 22:29:34,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8714859437751004 [2025-03-13 22:29:34,854 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 173 flow. Second operand 6 states and 434 transitions. [2025-03-13 22:29:34,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 217 flow [2025-03-13 22:29:34,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:34,860 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 187 flow [2025-03-13 22:29:34,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-03-13 22:29:34,864 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-03-13 22:29:34,864 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 187 flow [2025-03-13 22:29:34,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:34,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:34,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] [2025-03-13 22:29:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:29:34,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:29:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash -95299855, now seen corresponding path program 1 times [2025-03-13 22:29:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92402975] [2025-03-13 22:29:34,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:34,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:29:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:29:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92402975] [2025-03-13 22:29:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92402975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:35,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960937453] [2025-03-13 22:29:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:35,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:35,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:35,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 83 [2025-03-13 22:29:35,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:35,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 83 [2025-03-13 22:29:35,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:35,479 INFO L124 PetriNetUnfolderBase]: 70/365 cut-off events. [2025-03-13 22:29:35,479 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2025-03-13 22:29:35,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 365 events. 70/365 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1715 event pairs, 35 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 504. Up to 150 conditions per place. [2025-03-13 22:29:35,482 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 23 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-03-13 22:29:35,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 319 flow [2025-03-13 22:29:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-13 22:29:35,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-03-13 22:29:35,487 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 187 flow. Second operand 6 states and 394 transitions. [2025-03-13 22:29:35,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 319 flow [2025-03-13 22:29:35,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 305 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:35,491 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 323 flow [2025-03-13 22:29:35,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-03-13 22:29:35,492 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2025-03-13 22:29:35,492 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 323 flow [2025-03-13 22:29:35,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:35,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:35,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:29:35,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:29:35,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 106171396, now seen corresponding path program 1 times [2025-03-13 22:29:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757745625] [2025-03-13 22:29:35,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:35,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:29:35,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:29:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757745625] [2025-03-13 22:29:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757745625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:35,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7172551] [2025-03-13 22:29:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:35,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:35,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:35,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:35,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2025-03-13 22:29:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:35,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2025-03-13 22:29:35,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:35,958 INFO L124 PetriNetUnfolderBase]: 130/487 cut-off events. [2025-03-13 22:29:35,958 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2025-03-13 22:29:35,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 487 events. 130/487 cut-off events. For 142/176 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2429 event pairs, 23 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 987. Up to 238 conditions per place. [2025-03-13 22:29:35,963 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 33 selfloop transitions, 48 changer transitions 7/145 dead transitions. [2025-03-13 22:29:35,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 641 flow [2025-03-13 22:29:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2025-03-13 22:29:35,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734939759036144 [2025-03-13 22:29:35,965 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 323 flow. Second operand 6 states and 435 transitions. [2025-03-13 22:29:35,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 641 flow [2025-03-13 22:29:35,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:35,971 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 697 flow [2025-03-13 22:29:35,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2025-03-13 22:29:35,972 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2025-03-13 22:29:35,972 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 697 flow [2025-03-13 22:29:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:35,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] [2025-03-13 22:29:35,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:29:35,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:29:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash -870616162, now seen corresponding path program 1 times [2025-03-13 22:29:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875498291] [2025-03-13 22:29:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:35,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:29:35,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:29:35,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:35,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875498291] [2025-03-13 22:29:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875498291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:36,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256093178] [2025-03-13 22:29:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:36,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 83 [2025-03-13 22:29:36,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:36,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:36,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 83 [2025-03-13 22:29:36,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:36,439 INFO L124 PetriNetUnfolderBase]: 142/522 cut-off events. [2025-03-13 22:29:36,440 INFO L125 PetriNetUnfolderBase]: For 548/675 co-relation queries the response was YES. [2025-03-13 22:29:36,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 522 events. 142/522 cut-off events. For 548/675 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2874 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1481. Up to 241 conditions per place. [2025-03-13 22:29:36,443 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 73 selfloop transitions, 25 changer transitions 13/166 dead transitions. [2025-03-13 22:29:36,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 1080 flow [2025-03-13 22:29:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2025-03-13 22:29:36,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8092369477911646 [2025-03-13 22:29:36,444 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 697 flow. Second operand 6 states and 403 transitions. [2025-03-13 22:29:36,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 1080 flow [2025-03-13 22:29:36,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1062 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:36,451 INFO L231 Difference]: Finished difference. Result has 107 places, 153 transitions, 914 flow [2025-03-13 22:29:36,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=107, PETRI_TRANSITIONS=153} [2025-03-13 22:29:36,452 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2025-03-13 22:29:36,452 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 914 flow [2025-03-13 22:29:36,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.166666666666664) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:36,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:36,452 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:36,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:29:36,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 22:29:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2118060071, now seen corresponding path program 1 times [2025-03-13 22:29:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920132420] [2025-03-13 22:29:36,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:36,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:29:36,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:29:36,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:36,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:36,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:36,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:29:36,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:29:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:36,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:29:36,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:36,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-13 22:29:36,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-03-13 22:29:36,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-03-13 22:29:36,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-03-13 22:29:36,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-03-13 22:29:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:29:36,510 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:29:36,511 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:29:36,511 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:29:36,523 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:29:36,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 102 transitions, 220 flow [2025-03-13 22:29:36,536 INFO L124 PetriNetUnfolderBase]: 4/198 cut-off events. [2025-03-13 22:29:36,537 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:29:36,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 198 events. 4/198 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 394 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-03-13 22:29:36,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 102 transitions, 220 flow [2025-03-13 22:29:36,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 102 transitions, 220 flow [2025-03-13 22:29:36,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:36,539 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;@7dec749c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:36,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 22:29:36,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:36,542 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-13 22:29:36,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:36,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:36,542 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] [2025-03-13 22:29:36,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -523518659, now seen corresponding path program 1 times [2025-03-13 22:29:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-03-13 22:29:36,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:36,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:29:36,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:29:36,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-03-13 22:29:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836074274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:36,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722243216] [2025-03-13 22:29:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:36,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:36,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:36,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 102 [2025-03-13 22:29:36,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:36,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:36,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 102 [2025-03-13 22:29:36,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:36,684 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2025-03-13 22:29:36,684 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-13 22:29:36,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 203 events. 3/203 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 143. Up to 32 conditions per place. [2025-03-13 22:29:36,685 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 14 selfloop transitions, 2 changer transitions 6/107 dead transitions. [2025-03-13 22:29:36,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 272 flow [2025-03-13 22:29:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2025-03-13 22:29:36,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2025-03-13 22:29:36,686 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 220 flow. Second operand 6 states and 539 transitions. [2025-03-13 22:29:36,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 272 flow [2025-03-13 22:29:36,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:36,688 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 238 flow [2025-03-13 22:29:36,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2025-03-13 22:29:36,688 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2025-03-13 22:29:36,688 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 238 flow [2025-03-13 22:29:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:36,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:36,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:36,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:29:36,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:36,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash 801288215, now seen corresponding path program 1 times [2025-03-13 22:29:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-03-13 22:29:36,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:36,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:29:36,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:29:36,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:36,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226578946] [2025-03-13 22:29:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226578946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:36,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827258129] [2025-03-13 22:29:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:36,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:36,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:36,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:36,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2025-03-13 22:29:36,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:36,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:36,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2025-03-13 22:29:36,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:37,224 INFO L124 PetriNetUnfolderBase]: 902/2767 cut-off events. [2025-03-13 22:29:37,224 INFO L125 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-03-13 22:29:37,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2767 events. 902/2767 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 21387 event pairs, 529 based on Foata normal form. 0/2527 useless extension candidates. Maximal degree in co-relation 3139. Up to 1384 conditions per place. [2025-03-13 22:29:37,238 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 31 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2025-03-13 22:29:37,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 457 flow [2025-03-13 22:29:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2025-03-13 22:29:37,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2025-03-13 22:29:37,240 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 238 flow. Second operand 6 states and 495 transitions. [2025-03-13 22:29:37,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 457 flow [2025-03-13 22:29:37,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 445 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:37,243 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 480 flow [2025-03-13 22:29:37,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2025-03-13 22:29:37,244 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2025-03-13 22:29:37,245 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 480 flow [2025-03-13 22:29:37,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:37,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:37,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:37,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:29:37,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:37,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2042375175, now seen corresponding path program 1 times [2025-03-13 22:29:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678644062] [2025-03-13 22:29:37,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:37,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:29:37,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:29:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678644062] [2025-03-13 22:29:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678644062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825171083] [2025-03-13 22:29:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:37,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:37,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:37,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:37,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2025-03-13 22:29:37,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:37,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2025-03-13 22:29:37,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:37,992 INFO L124 PetriNetUnfolderBase]: 1866/4735 cut-off events. [2025-03-13 22:29:37,992 INFO L125 PetriNetUnfolderBase]: For 1553/1782 co-relation queries the response was YES. [2025-03-13 22:29:37,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 4735 events. 1866/4735 cut-off events. For 1553/1782 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37456 event pairs, 434 based on Foata normal form. 0/4427 useless extension candidates. Maximal degree in co-relation 8662. Up to 2580 conditions per place. [2025-03-13 22:29:38,016 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/233 dead transitions. [2025-03-13 22:29:38,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 1226 flow [2025-03-13 22:29:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2025-03-13 22:29:38,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2025-03-13 22:29:38,019 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 480 flow. Second operand 6 states and 543 transitions. [2025-03-13 22:29:38,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 1226 flow [2025-03-13 22:29:38,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:38,030 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 1316 flow [2025-03-13 22:29:38,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=125, PETRI_TRANSITIONS=225} [2025-03-13 22:29:38,031 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2025-03-13 22:29:38,032 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 1316 flow [2025-03-13 22:29:38,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:38,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:38,032 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] [2025-03-13 22:29:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:29:38,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:38,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1458813421, now seen corresponding path program 1 times [2025-03-13 22:29:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974190670] [2025-03-13 22:29:38,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:38,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:29:38,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:29:38,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:38,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974190670] [2025-03-13 22:29:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974190670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:38,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:38,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346285396] [2025-03-13 22:29:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:38,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:38,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:38,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:38,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2025-03-13 22:29:38,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 225 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:38,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:38,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2025-03-13 22:29:38,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:38,851 INFO L124 PetriNetUnfolderBase]: 2323/5703 cut-off events. [2025-03-13 22:29:38,851 INFO L125 PetriNetUnfolderBase]: For 5573/6281 co-relation queries the response was YES. [2025-03-13 22:29:38,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17625 conditions, 5703 events. 2323/5703 cut-off events. For 5573/6281 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46166 event pairs, 291 based on Foata normal form. 2/5470 useless extension candidates. Maximal degree in co-relation 14127. Up to 3131 conditions per place. [2025-03-13 22:29:38,885 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2025-03-13 22:29:38,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2250 flow [2025-03-13 22:29:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-13 22:29:38,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.826797385620915 [2025-03-13 22:29:38,886 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 1316 flow. Second operand 6 states and 506 transitions. [2025-03-13 22:29:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2250 flow [2025-03-13 22:29:38,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2232 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:38,949 INFO L231 Difference]: Finished difference. Result has 135 places, 296 transitions, 2156 flow [2025-03-13 22:29:38,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2156, PETRI_PLACES=135, PETRI_TRANSITIONS=296} [2025-03-13 22:29:38,950 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2025-03-13 22:29:38,950 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 296 transitions, 2156 flow [2025-03-13 22:29:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:38,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:38,951 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] [2025-03-13 22:29:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:29:38,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:38,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 641108895, now seen corresponding path program 1 times [2025-03-13 22:29:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035525634] [2025-03-13 22:29:38,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:29:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035525634] [2025-03-13 22:29:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035525634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:39,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:39,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119539104] [2025-03-13 22:29:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:39,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:39,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:39,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:39,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2025-03-13 22:29:39,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 296 transitions, 2156 flow. Second operand has 14 states, 14 states have (on average 64.57142857142857) internal successors, (904), 14 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:39,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:39,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2025-03-13 22:29:39,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:42,675 INFO L124 PetriNetUnfolderBase]: 5554/12664 cut-off events. [2025-03-13 22:29:42,675 INFO L125 PetriNetUnfolderBase]: For 19942/21930 co-relation queries the response was YES. [2025-03-13 22:29:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42676 conditions, 12664 events. 5554/12664 cut-off events. For 19942/21930 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 112702 event pairs, 201 based on Foata normal form. 313/12688 useless extension candidates. Maximal degree in co-relation 31338. Up to 3786 conditions per place. [2025-03-13 22:29:42,741 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 691 selfloop transitions, 613 changer transitions 12/1383 dead transitions. [2025-03-13 22:29:42,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1383 transitions, 12637 flow [2025-03-13 22:29:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-13 22:29:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-13 22:29:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4687 transitions. [2025-03-13 22:29:42,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7069381598793364 [2025-03-13 22:29:42,750 INFO L175 Difference]: Start difference. First operand has 135 places, 296 transitions, 2156 flow. Second operand 65 states and 4687 transitions. [2025-03-13 22:29:42,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1383 transitions, 12637 flow [2025-03-13 22:29:42,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1383 transitions, 12161 flow, removed 238 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:42,823 INFO L231 Difference]: Finished difference. Result has 225 places, 948 transitions, 9073 flow [2025-03-13 22:29:42,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=9073, PETRI_PLACES=225, PETRI_TRANSITIONS=948} [2025-03-13 22:29:42,824 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2025-03-13 22:29:42,824 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 948 transitions, 9073 flow [2025-03-13 22:29:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.57142857142857) internal successors, (904), 14 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:42,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:42,825 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] [2025-03-13 22:29:42,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:29:42,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -650180603, now seen corresponding path program 1 times [2025-03-13 22:29:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875695158] [2025-03-13 22:29:42,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:29:42,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:42,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:42,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:43,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875695158] [2025-03-13 22:29:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875695158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:43,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:43,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:43,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609850729] [2025-03-13 22:29:43,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:43,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:43,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:43,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:43,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:43,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-13 22:29:43,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 948 transitions, 9073 flow. Second operand has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:43,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:43,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-13 22:29:43,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:46,373 INFO L124 PetriNetUnfolderBase]: 6259/14427 cut-off events. [2025-03-13 22:29:46,374 INFO L125 PetriNetUnfolderBase]: For 87933/88714 co-relation queries the response was YES. [2025-03-13 22:29:46,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67479 conditions, 14427 events. 6259/14427 cut-off events. For 87933/88714 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 132123 event pairs, 117 based on Foata normal form. 303/14445 useless extension candidates. Maximal degree in co-relation 65948. Up to 4388 conditions per place. [2025-03-13 22:29:46,469 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 978 selfloop transitions, 461 changer transitions 16/1552 dead transitions. [2025-03-13 22:29:46,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1552 transitions, 18669 flow [2025-03-13 22:29:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 22:29:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 22:29:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3107 transitions. [2025-03-13 22:29:46,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6922905525846702 [2025-03-13 22:29:46,475 INFO L175 Difference]: Start difference. First operand has 225 places, 948 transitions, 9073 flow. Second operand 44 states and 3107 transitions. [2025-03-13 22:29:46,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1552 transitions, 18669 flow [2025-03-13 22:29:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1552 transitions, 18290 flow, removed 185 selfloop flow, removed 3 redundant places. [2025-03-13 22:29:46,979 INFO L231 Difference]: Finished difference. Result has 277 places, 1194 transitions, 13095 flow [2025-03-13 22:29:46,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=8697, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=13095, PETRI_PLACES=277, PETRI_TRANSITIONS=1194} [2025-03-13 22:29:46,980 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 173 predicate places. [2025-03-13 22:29:46,980 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 1194 transitions, 13095 flow [2025-03-13 22:29:46,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:46,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:46,980 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] [2025-03-13 22:29:46,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:29:46,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash -717714635, now seen corresponding path program 2 times [2025-03-13 22:29:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268732475] [2025-03-13 22:29:46,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:29:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:46,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:29:46,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:46,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:29:46,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268732475] [2025-03-13 22:29:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268732475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:47,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240579510] [2025-03-13 22:29:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:47,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:47,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:47,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:47,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-13 22:29:47,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1194 transitions, 13095 flow. Second operand has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:47,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:47,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-13 22:29:47,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:51,068 INFO L124 PetriNetUnfolderBase]: 6644/15588 cut-off events. [2025-03-13 22:29:51,068 INFO L125 PetriNetUnfolderBase]: For 143241/144773 co-relation queries the response was YES. [2025-03-13 22:29:51,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82682 conditions, 15588 events. 6644/15588 cut-off events. For 143241/144773 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 146804 event pairs, 240 based on Foata normal form. 358/15600 useless extension candidates. Maximal degree in co-relation 82010. Up to 4739 conditions per place. [2025-03-13 22:29:51,179 INFO L140 encePairwiseOnDemand]: 73/102 looper letters, 1079 selfloop transitions, 511 changer transitions 34/1721 dead transitions. [2025-03-13 22:29:51,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1721 transitions, 23059 flow [2025-03-13 22:29:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-13 22:29:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-13 22:29:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2603 transitions. [2025-03-13 22:29:51,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088779956427015 [2025-03-13 22:29:51,182 INFO L175 Difference]: Start difference. First operand has 277 places, 1194 transitions, 13095 flow. Second operand 36 states and 2603 transitions. [2025-03-13 22:29:51,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1721 transitions, 23059 flow [2025-03-13 22:29:51,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 1721 transitions, 22781 flow, removed 43 selfloop flow, removed 25 redundant places. [2025-03-13 22:29:51,855 INFO L231 Difference]: Finished difference. Result has 305 places, 1407 transitions, 17603 flow [2025-03-13 22:29:51,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=12875, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=17603, PETRI_PLACES=305, PETRI_TRANSITIONS=1407} [2025-03-13 22:29:51,857 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 201 predicate places. [2025-03-13 22:29:51,857 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 1407 transitions, 17603 flow [2025-03-13 22:29:51,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.57142857142857) internal successors, (890), 14 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:51,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:51,857 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] [2025-03-13 22:29:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:29:51,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:29:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1295760683, now seen corresponding path program 3 times [2025-03-13 22:29:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097817719] [2025-03-13 22:29:51,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:29:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:51,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:29:51,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:51,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 22:29:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097817719] [2025-03-13 22:29:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097817719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:29:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538491958] [2025-03-13 22:29:52,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:29:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:52,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:29:52,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:29:52,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:52,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 22:29:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:52,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 22:29:52,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:52,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:29:52,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:29:52,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:29:52,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:29:52,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-13 22:29:52,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-13 22:29:52,854 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 33 treesize of output 38 [2025-03-13 22:29:52,963 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 44 treesize of output 41 [2025-03-13 22:29:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:52,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:29:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538491958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:29:54,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:29:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-13 22:29:54,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118534445] [2025-03-13 22:29:54,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:29:54,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-13 22:29:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:54,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-13 22:29:54,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2025-03-13 22:29:59,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:07,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:11,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:12,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 102 [2025-03-13 22:30:12,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1407 transitions, 17603 flow. Second operand has 40 states, 40 states have (on average 57.9) internal successors, (2316), 40 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:30:12,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:30:12,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 102 [2025-03-13 22:30:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:30:22,368 INFO L124 PetriNetUnfolderBase]: 12917/29283 cut-off events. [2025-03-13 22:30:22,368 INFO L125 PetriNetUnfolderBase]: For 333970/338261 co-relation queries the response was YES. [2025-03-13 22:30:22,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175371 conditions, 29283 events. 12917/29283 cut-off events. For 333970/338261 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 299033 event pairs, 453 based on Foata normal form. 1344/29921 useless extension candidates. Maximal degree in co-relation 174904. Up to 9258 conditions per place. [2025-03-13 22:30:22,724 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1694 selfloop transitions, 1577 changer transitions 121/3465 dead transitions. [2025-03-13 22:30:22,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 3465 transitions, 55387 flow [2025-03-13 22:30:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-13 22:30:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-13 22:30:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3825 transitions. [2025-03-13 22:30:22,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2025-03-13 22:30:22,727 INFO L175 Difference]: Start difference. First operand has 305 places, 1407 transitions, 17603 flow. Second operand 57 states and 3825 transitions. [2025-03-13 22:30:22,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 3465 transitions, 55387 flow [2025-03-13 22:30:25,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 3465 transitions, 55003 flow, removed 156 selfloop flow, removed 17 redundant places. [2025-03-13 22:30:25,422 INFO L231 Difference]: Finished difference. Result has 372 places, 2548 transitions, 42551 flow [2025-03-13 22:30:25,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=17407, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=511, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=42551, PETRI_PLACES=372, PETRI_TRANSITIONS=2548} [2025-03-13 22:30:25,423 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 268 predicate places. [2025-03-13 22:30:25,423 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 2548 transitions, 42551 flow [2025-03-13 22:30:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 57.9) internal successors, (2316), 40 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:30:25,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:30:25,424 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] [2025-03-13 22:30:25,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:30:25,625 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-13 22:30:25,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:30:25,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:30:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1454004109, now seen corresponding path program 4 times [2025-03-13 22:30:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:30:25,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251871929] [2025-03-13 22:30:25,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:30:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:30:25,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:30:25,638 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:30:25,638 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:30:25,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:30:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:30:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:30:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251871929] [2025-03-13 22:30:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251871929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:30:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851851806] [2025-03-13 22:30:25,968 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:30:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:30:25,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:30:25,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:30:25,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:30:26,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:30:26,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:30:26,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:30:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:30:26,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-13 22:30:26,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:30:26,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:30:26,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:30:26,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:30:26,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:30:26,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-13 22:30:26,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-13 22:30:26,420 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 33 treesize of output 38 [2025-03-13 22:30:26,503 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 44 treesize of output 41 [2025-03-13 22:30:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:30:26,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:30:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:30:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851851806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:30:27,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:30:27,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-13 22:30:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533824511] [2025-03-13 22:30:27,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:30:27,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-13 22:30:27,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:30:27,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-13 22:30:27,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-03-13 22:30:36,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:40,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:40,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2025-03-13 22:30:40,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 2548 transitions, 42551 flow. Second operand has 40 states, 40 states have (on average 58.9) internal successors, (2356), 40 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:30:40,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:30:40,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2025-03-13 22:30:40,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:30:54,867 INFO L124 PetriNetUnfolderBase]: 13084/30293 cut-off events. [2025-03-13 22:30:54,868 INFO L125 PetriNetUnfolderBase]: For 640775/646043 co-relation queries the response was YES. [2025-03-13 22:30:55,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216445 conditions, 30293 events. 13084/30293 cut-off events. For 640775/646043 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 315183 event pairs, 437 based on Foata normal form. 1729/31172 useless extension candidates. Maximal degree in co-relation 215888. Up to 9896 conditions per place. [2025-03-13 22:30:55,291 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1947 selfloop transitions, 1594 changer transitions 16/3648 dead transitions. [2025-03-13 22:30:55,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3648 transitions, 70395 flow [2025-03-13 22:30:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-13 22:30:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-13 22:30:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3841 transitions. [2025-03-13 22:30:55,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6606467148262813 [2025-03-13 22:30:55,294 INFO L175 Difference]: Start difference. First operand has 372 places, 2548 transitions, 42551 flow. Second operand 57 states and 3841 transitions. [2025-03-13 22:30:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3648 transitions, 70395 flow [2025-03-13 22:31:01,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 3648 transitions, 67996 flow, removed 1089 selfloop flow, removed 24 redundant places. [2025-03-13 22:31:01,492 INFO L231 Difference]: Finished difference. Result has 424 places, 2975 transitions, 55718 flow [2025-03-13 22:31:01,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=40950, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=55718, PETRI_PLACES=424, PETRI_TRANSITIONS=2975} [2025-03-13 22:31:01,495 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 320 predicate places. [2025-03-13 22:31:01,495 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 2975 transitions, 55718 flow [2025-03-13 22:31:01,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 58.9) internal successors, (2356), 40 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:31:01,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:31:01,496 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] [2025-03-13 22:31:01,503 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-13 22:31:01,700 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-13 22:31:01,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-13 22:31:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:31:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -658567423, now seen corresponding path program 5 times [2025-03-13 22:31:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:31:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791978928] [2025-03-13 22:31:01,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:31:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:31:01,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:31:01,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:31:01,715 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:31:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:31:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:31:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:31:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791978928] [2025-03-13 22:31:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791978928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:31:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677928876] [2025-03-13 22:31:01,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:31:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:31:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:31:01,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:31:01,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:31:02,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-13 22:31:02,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:31:02,030 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:31:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:31:02,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-13 22:31:02,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:31:02,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:31:02,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:31:02,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:31:02,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:31:02,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-13 22:31:02,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:31:02,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-13 22:31:02,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:31:02,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-13 22:31:02,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-13 22:31:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:31:02,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:31:02,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) 0)))) is different from false [2025-03-13 22:31:02,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)))))) is different from false [2025-03-13 22:31:04,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_424 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_424) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) 0)))))) is different from false [2025-03-13 22:31:04,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:31:04,281 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 50 treesize of output 66 [2025-03-13 22:31:04,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:31:04,285 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 81 treesize of output 38 [2025-03-13 22:31:04,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-13 22:31:04,291 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:31:04,291 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 51 treesize of output 1 [2025-03-13 22:31:04,295 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:31:04,295 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 51 treesize of output 1 [2025-03-13 22:31:04,299 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:31:04,299 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 51 treesize of output 1 [2025-03-13 22:31:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:31:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677928876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:31:04,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:31:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 27 [2025-03-13 22:31:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117200678] [2025-03-13 22:31:04,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:31:04,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 22:31:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:31:04,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 22:31:04,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=498, Unknown=25, NotChecked=144, Total=756 [2025-03-13 22:31:04,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2025-03-13 22:31:04,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 2975 transitions, 55718 flow. Second operand has 28 states, 28 states have (on average 50.785714285714285) internal successors, (1422), 28 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:31:04,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:31:04,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2025-03-13 22:31:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand