./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:18:04,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:18:04,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:18:04,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:18:04,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:18:04,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:18:04,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:18:04,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:18:04,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:18:04,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:18:04,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:18:04,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:18:04,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:18:04,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:18:04,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:18:04,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:18:04,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:18:04,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:18:04,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:04,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:18:04,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:18:04,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:18:04,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:18:04,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:18:04,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:18:04,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:18:04,401 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-17 11:18:04,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:18:04,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:18:04,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:18:04,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:18:04,632 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:18:04,633 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-17 11:18:05,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1242d56/af7dd1717db7452a8cdd45895e4821f2/FLAGe3e42dbe7 [2025-03-17 11:18:06,086 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:18:06,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct.i [2025-03-17 11:18:06,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1242d56/af7dd1717db7452a8cdd45895e4821f2/FLAGe3e42dbe7 [2025-03-17 11:18:06,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1242d56/af7dd1717db7452a8cdd45895e4821f2 [2025-03-17 11:18:06,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:18:06,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:18:06,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:06,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:18:06,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:18:06,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a483e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06, skipping insertion in model container [2025-03-17 11:18:06,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:18:06,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:06,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:18:06,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:18:06,792 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:18:06,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06 WrapperNode [2025-03-17 11:18:06,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:18:06,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:06,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:18:06,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:18:06,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,820 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-03-17 11:18:06,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:18:06,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:18:06,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:18:06,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:18:06,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:18:06,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:18:06,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:18:06,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:18:06,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (1/1) ... [2025-03-17 11:18:06,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:18:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:06,863 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-17 11:18:06,868 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-17 11:18:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:18:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:18:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:18:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:18:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:18:06,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:18:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:18:06,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:18:06,885 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:18:07,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:18:07,019 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:18:07,246 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:18:07,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:18:07,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:18:07,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:18:07,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:07 BoogieIcfgContainer [2025-03-17 11:18:07,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:18:07,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:18:07,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:18:07,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:18:07,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:18:06" (1/3) ... [2025-03-17 11:18:07,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a31f8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:07, skipping insertion in model container [2025-03-17 11:18:07,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:18:06" (2/3) ... [2025-03-17 11:18:07,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a31f8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:18:07, skipping insertion in model container [2025-03-17 11:18:07,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:18:07" (3/3) ... [2025-03-17 11:18:07,264 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct.i [2025-03-17 11:18:07,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:18:07,277 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-17 11:18:07,277 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:18:07,336 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:18:07,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 83 transitions, 173 flow [2025-03-17 11:18:07,420 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2025-03-17 11:18:07,423 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:18:07,427 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-17 11:18:07,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 83 transitions, 173 flow [2025-03-17 11:18:07,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 173 flow [2025-03-17 11:18:07,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:07,446 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;@528406af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:07,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 11:18:07,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:07,461 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-17 11:18:07,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:07,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:07,462 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-17 11:18:07,463 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-17 11:18:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1554772501, now seen corresponding path program 1 times [2025-03-17 11:18:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014833867] [2025-03-17 11:18:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:07,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:18:07,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:18:07,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:07,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:07,775 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-17 11:18:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014833867] [2025-03-17 11:18:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014833867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680717310] [2025-03-17 11:18:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:07,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:07,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:07,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:07,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 83 [2025-03-17 11:18:07,930 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-17 11:18:07,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:07,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 83 [2025-03-17 11:18:07,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:08,002 INFO L124 PetriNetUnfolderBase]: 1/120 cut-off events. [2025-03-17 11:18:08,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:18:08,003 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-17 11:18:08,005 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 11 selfloop transitions, 2 changer transitions 6/87 dead transitions. [2025-03-17 11:18:08,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 87 transitions, 217 flow [2025-03-17 11:18:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2025-03-17 11:18:08,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8714859437751004 [2025-03-17 11:18:08,019 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 173 flow. Second operand 6 states and 434 transitions. [2025-03-17 11:18:08,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 87 transitions, 217 flow [2025-03-17 11:18:08,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:08,029 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 187 flow [2025-03-17 11:18:08,031 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-17 11:18:08,036 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 9 predicate places. [2025-03-17 11:18:08,037 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 187 flow [2025-03-17 11:18:08,037 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-17 11:18:08,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:08,037 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-17 11:18:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:18:08,038 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-17 11:18:08,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1852687587, now seen corresponding path program 1 times [2025-03-17 11:18:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399805449] [2025-03-17 11:18:08,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:18:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:18:08,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:08,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:08,433 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-17 11:18:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399805449] [2025-03-17 11:18:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399805449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:08,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168054076] [2025-03-17 11:18:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:08,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:08,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:08,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:08,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 83 [2025-03-17 11:18:08,571 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-17 11:18:08,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:08,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 83 [2025-03-17 11:18:08,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:08,725 INFO L124 PetriNetUnfolderBase]: 70/365 cut-off events. [2025-03-17 11:18:08,726 INFO L125 PetriNetUnfolderBase]: For 22/25 co-relation queries the response was YES. [2025-03-17 11:18:08,728 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 1728 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-17 11:18:08,731 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 23 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-03-17 11:18:08,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 319 flow [2025-03-17 11:18:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-17 11:18:08,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-03-17 11:18:08,736 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 187 flow. Second operand 6 states and 394 transitions. [2025-03-17 11:18:08,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 319 flow [2025-03-17 11:18:08,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 305 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 11:18:08,740 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 323 flow [2025-03-17 11:18:08,741 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-17 11:18:08,741 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2025-03-17 11:18:08,741 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 323 flow [2025-03-17 11:18:08,742 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-17 11:18:08,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:08,742 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-17 11:18:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:18:08,742 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-17 11:18:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 723621430, now seen corresponding path program 1 times [2025-03-17 11:18:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941497558] [2025-03-17 11:18:08,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:08,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:18:08,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:18:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:09,006 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-17 11:18:09,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941497558] [2025-03-17 11:18:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941497558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:09,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:09,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:09,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686264088] [2025-03-17 11:18:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:09,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:09,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:09,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2025-03-17 11:18:09,066 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-17 11:18:09,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:09,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2025-03-17 11:18:09,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:09,165 INFO L124 PetriNetUnfolderBase]: 130/487 cut-off events. [2025-03-17 11:18:09,165 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2025-03-17 11:18:09,167 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 2435 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-17 11:18:09,169 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 33 selfloop transitions, 48 changer transitions 7/145 dead transitions. [2025-03-17 11:18:09,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 145 transitions, 641 flow [2025-03-17 11:18:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2025-03-17 11:18:09,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734939759036144 [2025-03-17 11:18:09,171 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 323 flow. Second operand 6 states and 435 transitions. [2025-03-17 11:18:09,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 145 transitions, 641 flow [2025-03-17 11:18:09,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:09,175 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 697 flow [2025-03-17 11:18:09,175 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-17 11:18:09,175 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 20 predicate places. [2025-03-17 11:18:09,175 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 697 flow [2025-03-17 11:18:09,176 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-17 11:18:09,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:09,176 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-17 11:18:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:18:09,176 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-17 11:18:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash -481964718, now seen corresponding path program 1 times [2025-03-17 11:18:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216784384] [2025-03-17 11:18:09,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:18:09,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:18:09,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:09,422 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-17 11:18:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216784384] [2025-03-17 11:18:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216784384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:09,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76969075] [2025-03-17 11:18:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:09,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:09,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:09,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 83 [2025-03-17 11:18:09,524 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-17 11:18:09,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:09,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 83 [2025-03-17 11:18:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:09,622 INFO L124 PetriNetUnfolderBase]: 142/522 cut-off events. [2025-03-17 11:18:09,622 INFO L125 PetriNetUnfolderBase]: For 552/679 co-relation queries the response was YES. [2025-03-17 11:18:09,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 522 events. 142/522 cut-off events. For 552/679 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2875 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-17 11:18:09,625 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 73 selfloop transitions, 25 changer transitions 13/166 dead transitions. [2025-03-17 11:18:09,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 1080 flow [2025-03-17 11:18:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2025-03-17 11:18:09,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8092369477911646 [2025-03-17 11:18:09,626 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 697 flow. Second operand 6 states and 403 transitions. [2025-03-17 11:18:09,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 1080 flow [2025-03-17 11:18:09,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 166 transitions, 1062 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:09,634 INFO L231 Difference]: Finished difference. Result has 107 places, 153 transitions, 914 flow [2025-03-17 11:18:09,634 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-17 11:18:09,634 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2025-03-17 11:18:09,634 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 914 flow [2025-03-17 11:18:09,635 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-17 11:18:09,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:09,635 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-17 11:18:09,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:18:09,635 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-17 11:18:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash -940536838, now seen corresponding path program 1 times [2025-03-17 11:18:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489093327] [2025-03-17 11:18:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:09,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:09,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:09,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:09,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:18:09,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:18:09,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:18:09,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:18:09,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:18:09,687 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:18:09,688 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-17 11:18:09,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-03-17 11:18:09,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-03-17 11:18:09,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-03-17 11:18:09,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-03-17 11:18:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:18:09,690 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 11:18:09,691 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:18:09,691 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:18:09,706 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:18:09,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 102 transitions, 220 flow [2025-03-17 11:18:09,720 INFO L124 PetriNetUnfolderBase]: 4/198 cut-off events. [2025-03-17 11:18:09,720 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:18:09,720 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-17 11:18:09,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 102 transitions, 220 flow [2025-03-17 11:18:09,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 102 transitions, 220 flow [2025-03-17 11:18:09,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:18:09,722 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;@528406af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:18:09,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 11:18:09,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:18:09,724 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-17 11:18:09,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:18:09,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:09,724 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-17 11:18:09,725 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-17 11:18:09,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -916213653, now seen corresponding path program 1 times [2025-03-17 11:18:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900896208] [2025-03-17 11:18:09,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:09,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:18:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:18:09,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:09,771 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-17 11:18:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900896208] [2025-03-17 11:18:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900896208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227415293] [2025-03-17 11:18:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:18:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:18:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:18:09,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 102 [2025-03-17 11:18:09,831 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-17 11:18:09,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:09,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 102 [2025-03-17 11:18:09,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:09,862 INFO L124 PetriNetUnfolderBase]: 3/203 cut-off events. [2025-03-17 11:18:09,862 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 11:18:09,862 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 433 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-17 11:18:09,863 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 14 selfloop transitions, 2 changer transitions 6/107 dead transitions. [2025-03-17 11:18:09,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 272 flow [2025-03-17 11:18:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2025-03-17 11:18:09,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2025-03-17 11:18:09,864 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 220 flow. Second operand 6 states and 539 transitions. [2025-03-17 11:18:09,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 272 flow [2025-03-17 11:18:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:09,866 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 238 flow [2025-03-17 11:18:09,866 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-17 11:18:09,866 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places. [2025-03-17 11:18:09,866 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 238 flow [2025-03-17 11:18:09,866 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-17 11:18:09,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:09,867 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-17 11:18:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:18:09,867 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-17 11:18:09,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1545691639, now seen corresponding path program 1 times [2025-03-17 11:18:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745645901] [2025-03-17 11:18:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:09,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:18:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:18:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:09,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:10,077 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-17 11:18:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745645901] [2025-03-17 11:18:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745645901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:10,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177073162] [2025-03-17 11:18:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:10,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:10,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 102 [2025-03-17 11:18:10,202 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-17 11:18:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 102 [2025-03-17 11:18:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:10,522 INFO L124 PetriNetUnfolderBase]: 902/2767 cut-off events. [2025-03-17 11:18:10,523 INFO L125 PetriNetUnfolderBase]: For 186/192 co-relation queries the response was YES. [2025-03-17 11:18:10,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2767 events. 902/2767 cut-off events. For 186/192 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 21410 event pairs, 529 based on Foata normal form. 0/2526 useless extension candidates. Maximal degree in co-relation 3139. Up to 1384 conditions per place. [2025-03-17 11:18:10,534 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 31 selfloop transitions, 38 changer transitions 0/139 dead transitions. [2025-03-17 11:18:10,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 457 flow [2025-03-17 11:18:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2025-03-17 11:18:10,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2025-03-17 11:18:10,535 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 238 flow. Second operand 6 states and 495 transitions. [2025-03-17 11:18:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 139 transitions, 457 flow [2025-03-17 11:18:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 445 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 11:18:10,538 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 480 flow [2025-03-17 11:18:10,539 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-17 11:18:10,539 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2025-03-17 11:18:10,539 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 480 flow [2025-03-17 11:18:10,540 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-17 11:18:10,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:10,540 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-17 11:18:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:18:10,540 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-17 11:18:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1424925141, now seen corresponding path program 1 times [2025-03-17 11:18:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072142557] [2025-03-17 11:18:10,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:18:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:18:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:10,729 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-17 11:18:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072142557] [2025-03-17 11:18:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072142557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094166888] [2025-03-17 11:18:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:10,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:10,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:10,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:10,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2025-03-17 11:18:10,793 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-17 11:18:10,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:10,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2025-03-17 11:18:10,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:11,275 INFO L124 PetriNetUnfolderBase]: 1866/4735 cut-off events. [2025-03-17 11:18:11,276 INFO L125 PetriNetUnfolderBase]: For 1553/1782 co-relation queries the response was YES. [2025-03-17 11:18:11,284 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 37384 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-17 11:18:11,301 INFO L140 encePairwiseOnDemand]: 83/102 looper letters, 63 selfloop transitions, 92 changer transitions 0/233 dead transitions. [2025-03-17 11:18:11,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 1226 flow [2025-03-17 11:18:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2025-03-17 11:18:11,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2025-03-17 11:18:11,305 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 480 flow. Second operand 6 states and 543 transitions. [2025-03-17 11:18:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 1226 flow [2025-03-17 11:18:11,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:11,315 INFO L231 Difference]: Finished difference. Result has 125 places, 225 transitions, 1316 flow [2025-03-17 11:18:11,316 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-17 11:18:11,317 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 21 predicate places. [2025-03-17 11:18:11,317 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 225 transitions, 1316 flow [2025-03-17 11:18:11,317 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-17 11:18:11,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:11,317 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-17 11:18:11,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:18:11,317 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-17 11:18:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1070161977, now seen corresponding path program 1 times [2025-03-17 11:18:11,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370639668] [2025-03-17 11:18:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:11,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:18:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:18:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:11,518 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-17 11:18:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370639668] [2025-03-17 11:18:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370639668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:11,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:11,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:18:11,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143938051] [2025-03-17 11:18:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:11,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:18:11,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:11,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:18:11,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:18:11,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2025-03-17 11:18:11,674 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-17 11:18:11,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:11,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2025-03-17 11:18:11,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:12,263 INFO L124 PetriNetUnfolderBase]: 2321/5745 cut-off events. [2025-03-17 11:18:12,263 INFO L125 PetriNetUnfolderBase]: For 5611/6308 co-relation queries the response was YES. [2025-03-17 11:18:12,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17696 conditions, 5745 events. 2321/5745 cut-off events. For 5611/6308 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46857 event pairs, 295 based on Foata normal form. 2/5511 useless extension candidates. Maximal degree in co-relation 14366. Up to 3135 conditions per place. [2025-03-17 11:18:12,338 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 145 selfloop transitions, 76 changer transitions 0/298 dead transitions. [2025-03-17 11:18:12,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 298 transitions, 2250 flow [2025-03-17 11:18:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:18:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:18:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-17 11:18:12,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.826797385620915 [2025-03-17 11:18:12,341 INFO L175 Difference]: Start difference. First operand has 125 places, 225 transitions, 1316 flow. Second operand 6 states and 506 transitions. [2025-03-17 11:18:12,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 298 transitions, 2250 flow [2025-03-17 11:18:12,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 298 transitions, 2232 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:12,376 INFO L231 Difference]: Finished difference. Result has 135 places, 296 transitions, 2156 flow [2025-03-17 11:18:12,378 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-17 11:18:12,380 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 31 predicate places. [2025-03-17 11:18:12,381 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 296 transitions, 2156 flow [2025-03-17 11:18:12,381 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-17 11:18:12,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:12,381 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-17 11:18:12,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:18:12,382 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-17 11:18:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 271911883, now seen corresponding path program 1 times [2025-03-17 11:18:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139446716] [2025-03-17 11:18:12,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:18:12,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:12,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:12,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:12,772 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-17 11:18:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139446716] [2025-03-17 11:18:12,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139446716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:12,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:12,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:18:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805871580] [2025-03-17 11:18:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:12,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:18:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:12,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:18:12,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:18:13,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 102 [2025-03-17 11:18:13,310 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-17 11:18:13,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:13,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 102 [2025-03-17 11:18:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:16,873 INFO L124 PetriNetUnfolderBase]: 5494/12469 cut-off events. [2025-03-17 11:18:16,873 INFO L125 PetriNetUnfolderBase]: For 20879/21509 co-relation queries the response was YES. [2025-03-17 11:18:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42307 conditions, 12469 events. 5494/12469 cut-off events. For 20879/21509 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 111414 event pairs, 201 based on Foata normal form. 256/12482 useless extension candidates. Maximal degree in co-relation 37007. Up to 3775 conditions per place. [2025-03-17 11:18:16,939 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 691 selfloop transitions, 612 changer transitions 13/1383 dead transitions. [2025-03-17 11:18:16,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1383 transitions, 12637 flow [2025-03-17 11:18:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-17 11:18:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-17 11:18:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4687 transitions. [2025-03-17 11:18:16,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7069381598793364 [2025-03-17 11:18:16,947 INFO L175 Difference]: Start difference. First operand has 135 places, 296 transitions, 2156 flow. Second operand 65 states and 4687 transitions. [2025-03-17 11:18:16,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1383 transitions, 12637 flow [2025-03-17 11:18:17,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1383 transitions, 12161 flow, removed 238 selfloop flow, removed 0 redundant places. [2025-03-17 11:18:17,020 INFO L231 Difference]: Finished difference. Result has 225 places, 947 transitions, 9059 flow [2025-03-17 11:18:17,020 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=9059, PETRI_PLACES=225, PETRI_TRANSITIONS=947} [2025-03-17 11:18:17,021 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2025-03-17 11:18:17,021 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 947 transitions, 9059 flow [2025-03-17 11:18:17,022 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-17 11:18:17,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:17,022 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-17 11:18:17,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:18:17,022 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-17 11:18:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 603314894, now seen corresponding path program 1 times [2025-03-17 11:18:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338053734] [2025-03-17 11:18:17,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:18:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:18:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:17,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:18:17,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:17,397 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-17 11:18:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338053734] [2025-03-17 11:18:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338053734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:18:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417991908] [2025-03-17 11:18:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:18:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:18:17,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:18:17,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-17 11:18:17,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 947 transitions, 9059 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-17 11:18:17,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:17,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-17 11:18:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:20,867 INFO L124 PetriNetUnfolderBase]: 5959/14234 cut-off events. [2025-03-17 11:18:20,867 INFO L125 PetriNetUnfolderBase]: For 85546/86752 co-relation queries the response was YES. [2025-03-17 11:18:20,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64849 conditions, 14234 events. 5959/14234 cut-off events. For 85546/86752 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 132832 event pairs, 267 based on Foata normal form. 198/14071 useless extension candidates. Maximal degree in co-relation 63318. Up to 4150 conditions per place. [2025-03-17 11:18:20,967 INFO L140 encePairwiseOnDemand]: 73/102 looper letters, 892 selfloop transitions, 424 changer transitions 21/1434 dead transitions. [2025-03-17 11:18:20,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1434 transitions, 16651 flow [2025-03-17 11:18:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 11:18:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-17 11:18:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2603 transitions. [2025-03-17 11:18:20,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7088779956427015 [2025-03-17 11:18:20,971 INFO L175 Difference]: Start difference. First operand has 225 places, 947 transitions, 9059 flow. Second operand 36 states and 2603 transitions. [2025-03-17 11:18:20,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1434 transitions, 16651 flow [2025-03-17 11:18:21,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1434 transitions, 16270 flow, removed 185 selfloop flow, removed 3 redundant places. [2025-03-17 11:18:21,494 INFO L231 Difference]: Finished difference. Result has 278 places, 1147 transitions, 12306 flow [2025-03-17 11:18:21,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=8683, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=12306, PETRI_PLACES=278, PETRI_TRANSITIONS=1147} [2025-03-17 11:18:21,495 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 174 predicate places. [2025-03-17 11:18:21,496 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 1147 transitions, 12306 flow [2025-03-17 11:18:21,496 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-17 11:18:21,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:21,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-17 11:18:21,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:18:21,496 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-17 11:18:21,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1088419920, now seen corresponding path program 2 times [2025-03-17 11:18:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563257791] [2025-03-17 11:18:21,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:18:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:21,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:18:21,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:21,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:18:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:21,795 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-17 11:18:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563257791] [2025-03-17 11:18:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563257791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:18:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:18:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:18:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930252014] [2025-03-17 11:18:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:18:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:18:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:21,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:18:21,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:18:22,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 102 [2025-03-17 11:18:22,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1147 transitions, 12306 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-17 11:18:22,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:22,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 102 [2025-03-17 11:18:22,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:26,028 INFO L124 PetriNetUnfolderBase]: 6631/15550 cut-off events. [2025-03-17 11:18:26,028 INFO L125 PetriNetUnfolderBase]: For 116261/117323 co-relation queries the response was YES. [2025-03-17 11:18:26,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80571 conditions, 15550 events. 6631/15550 cut-off events. For 116261/117323 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 145636 event pairs, 314 based on Foata normal form. 344/15537 useless extension candidates. Maximal degree in co-relation 80126. Up to 4763 conditions per place. [2025-03-17 11:18:26,154 INFO L140 encePairwiseOnDemand]: 78/102 looper letters, 1070 selfloop transitions, 583 changer transitions 12/1762 dead transitions. [2025-03-17 11:18:26,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 1762 transitions, 23395 flow [2025-03-17 11:18:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 11:18:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-17 11:18:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3107 transitions. [2025-03-17 11:18:26,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6922905525846702 [2025-03-17 11:18:26,159 INFO L175 Difference]: Start difference. First operand has 278 places, 1147 transitions, 12306 flow. Second operand 44 states and 3107 transitions. [2025-03-17 11:18:26,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 1762 transitions, 23395 flow [2025-03-17 11:18:26,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1762 transitions, 23247 flow, removed 56 selfloop flow, removed 12 redundant places. [2025-03-17 11:18:26,926 INFO L231 Difference]: Finished difference. Result has 319 places, 1421 transitions, 17945 flow [2025-03-17 11:18:26,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=12182, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=17945, PETRI_PLACES=319, PETRI_TRANSITIONS=1421} [2025-03-17 11:18:26,928 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 215 predicate places. [2025-03-17 11:18:26,928 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 1421 transitions, 17945 flow [2025-03-17 11:18:26,928 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-17 11:18:26,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:26,928 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-17 11:18:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:18:26,929 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-17 11:18:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash -42130802, now seen corresponding path program 3 times [2025-03-17 11:18:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306513556] [2025-03-17 11:18:26,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:18:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:26,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:18:26,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:26,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:18:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:27,258 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-17 11:18:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306513556] [2025-03-17 11:18:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306513556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:18:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024613471] [2025-03-17 11:18:27,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:18:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:18:27,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:27,261 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-17 11:18:27,262 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-17 11:18:27,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:18:27,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:27,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:18:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 11:18:27,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:18:27,392 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-17 11:18:27,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:18:27,476 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-17 11:18:27,796 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-17 11:18:27,828 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-17 11:18:27,879 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-17 11:18:27,979 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-17 11:18:28,111 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-17 11:18:28,144 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-17 11:18:28,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:18:29,684 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-17 11:18:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024613471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:18:29,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:18:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-17 11:18:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297634791] [2025-03-17 11:18:29,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:18:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 11:18:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:29,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 11:18:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:18:37,444 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-17 11:18:41,536 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-17 11:18:41,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2025-03-17 11:18:41,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1421 transitions, 17945 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-17 11:18:41,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:18:41,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2025-03-17 11:18:41,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:18:51,164 INFO L124 PetriNetUnfolderBase]: 11177/26077 cut-off events. [2025-03-17 11:18:51,164 INFO L125 PetriNetUnfolderBase]: For 305874/310002 co-relation queries the response was YES. [2025-03-17 11:18:51,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157199 conditions, 26077 events. 11177/26077 cut-off events. For 305874/310002 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 266802 event pairs, 374 based on Foata normal form. 1352/26645 useless extension candidates. Maximal degree in co-relation 156696. Up to 8087 conditions per place. [2025-03-17 11:18:51,585 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1503 selfloop transitions, 1313 changer transitions 23/2930 dead transitions. [2025-03-17 11:18:51,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 2930 transitions, 47224 flow [2025-03-17 11:18:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 11:18:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-17 11:18:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3843 transitions. [2025-03-17 11:18:51,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609907120743034 [2025-03-17 11:18:51,588 INFO L175 Difference]: Start difference. First operand has 319 places, 1421 transitions, 17945 flow. Second operand 57 states and 3843 transitions. [2025-03-17 11:18:51,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 2930 transitions, 47224 flow [2025-03-17 11:18:54,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 2930 transitions, 46430 flow, removed 268 selfloop flow, removed 31 redundant places. [2025-03-17 11:18:54,178 INFO L231 Difference]: Finished difference. Result has 365 places, 2248 transitions, 36294 flow [2025-03-17 11:18:54,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=17512, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=36294, PETRI_PLACES=365, PETRI_TRANSITIONS=2248} [2025-03-17 11:18:54,180 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 261 predicate places. [2025-03-17 11:18:54,180 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 2248 transitions, 36294 flow [2025-03-17 11:18:54,181 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-17 11:18:54,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:18:54,181 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-17 11:18:54,189 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-17 11:18:54,381 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-17 11:18:54,381 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-17 11:18:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:18:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash -190563852, now seen corresponding path program 4 times [2025-03-17 11:18:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:18:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944239459] [2025-03-17 11:18:54,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:18:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:18:54,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:18:54,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:54,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:18:54,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:54,638 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-17 11:18:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:18:54,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944239459] [2025-03-17 11:18:54,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944239459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:18:54,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199574616] [2025-03-17 11:18:54,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:18:54,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:18:54,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:18:54,643 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-17 11:18:54,645 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-17 11:18:54,689 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:18:54,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:18:54,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 11:18:54,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:18:54,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 11:18:54,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:18:54,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:18:54,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:18:54,780 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-17 11:18:54,953 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-17 11:18:55,048 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-17 11:18:55,079 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-17 11:18:55,120 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-17 11:18:55,162 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-17 11:18:55,196 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-17 11:18:55,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:18:56,235 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-17 11:18:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199574616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:18:56,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:18:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-17 11:18:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323304749] [2025-03-17 11:18:56,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:18:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 11:18:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:18:56,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 11:18:56,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:19:03,388 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-17 11:19:07,520 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-17 11:19:07,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 102 [2025-03-17 11:19:07,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 2248 transitions, 36294 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-17 11:19:07,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:07,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 102 [2025-03-17 11:19:07,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:19:21,679 INFO L124 PetriNetUnfolderBase]: 13377/31027 cut-off events. [2025-03-17 11:19:21,679 INFO L125 PetriNetUnfolderBase]: For 531599/537525 co-relation queries the response was YES. [2025-03-17 11:19:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212903 conditions, 31027 events. 13377/31027 cut-off events. For 531599/537525 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 324686 event pairs, 423 based on Foata normal form. 1931/32147 useless extension candidates. Maximal degree in co-relation 212366. Up to 9950 conditions per place. [2025-03-17 11:19:22,245 INFO L140 encePairwiseOnDemand]: 69/102 looper letters, 1725 selfloop transitions, 2007 changer transitions 25/3848 dead transitions. [2025-03-17 11:19:22,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 3848 transitions, 71929 flow [2025-03-17 11:19:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 11:19:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-17 11:19:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3847 transitions. [2025-03-17 11:19:22,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616787065703474 [2025-03-17 11:19:22,248 INFO L175 Difference]: Start difference. First operand has 365 places, 2248 transitions, 36294 flow. Second operand 57 states and 3847 transitions. [2025-03-17 11:19:22,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 3848 transitions, 71929 flow [2025-03-17 11:19:27,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 3848 transitions, 71254 flow, removed 236 selfloop flow, removed 23 redundant places. [2025-03-17 11:19:27,569 INFO L231 Difference]: Finished difference. Result has 424 places, 3059 transitions, 59711 flow [2025-03-17 11:19:27,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=35619, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=59711, PETRI_PLACES=424, PETRI_TRANSITIONS=3059} [2025-03-17 11:19:27,571 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 320 predicate places. [2025-03-17 11:19:27,571 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 3059 transitions, 59711 flow [2025-03-17 11:19:27,572 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-17 11:19:27,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:19:27,572 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-17 11:19:27,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:19:27,772 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-17 11:19:27,773 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-17 11:19:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:19:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1637450170, now seen corresponding path program 5 times [2025-03-17 11:19:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:19:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590365044] [2025-03-17 11:19:27,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:19:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:19:27,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:19:27,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:19:27,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:19:27,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:28,099 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-17 11:19:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:19:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590365044] [2025-03-17 11:19:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590365044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:19:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846222505] [2025-03-17 11:19:28,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:19:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:19:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:19:28,102 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-17 11:19:28,103 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-17 11:19:28,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-17 11:19:28,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:19:28,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:19:28,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:19:28,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 11:19:28,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:19:28,175 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-17 11:19:28,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:19:28,205 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-17 11:19:28,253 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-17 11:19:28,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:19:28,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:19:28,359 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-17 11:19:28,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:19:28,398 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-17 11:19:28,442 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-17 11:19:28,471 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-17 11:19:28,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:19:28,487 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-17 11:19:28,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse3))) (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) .cse1 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|) .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|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .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|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse3)) 0)))))) is different from false [2025-03-17 11:19:28,684 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-17 11:19:28,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:19:28,701 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-17 11:19:28,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:19:28,706 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-17 11:19:28,709 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-17 11:19:28,715 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:19:28,715 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-17 11:19:28,720 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:19:28,721 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-17 11:19:28,725 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-17 11:19:28,726 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-17 11:19:28,755 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-17 11:19:28,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846222505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:19:28,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:19:28,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 27 [2025-03-17 11:19:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676031717] [2025-03-17 11:19:28,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:19:28,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:19:28,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:19:28,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:19:28,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=489, Unknown=30, NotChecked=144, Total=756 [2025-03-17 11:19:28,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 102 [2025-03-17 11:19:28,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 3059 transitions, 59711 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-17 11:19:28,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:19:28,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 102 [2025-03-17 11:19:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand