./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:47,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:47,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:47,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:47,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:47,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:47,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:47,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:47,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:47,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:47,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:47,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:47,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:47,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:47,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:47,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:47,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:47,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:47,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:47,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:47,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:47,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:47,169 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-04 06:55:47,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:47,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:47,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:47,409 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:47,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:47,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-04 06:55:48,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d55d1c7/88333e683a4d48cab7e73465a068906c/FLAG35d1e7744 [2025-03-04 06:55:48,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:48,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-04 06:55:48,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d55d1c7/88333e683a4d48cab7e73465a068906c/FLAG35d1e7744 [2025-03-04 06:55:49,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d55d1c7/88333e683a4d48cab7e73465a068906c [2025-03-04 06:55:49,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:49,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:49,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:49,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:49,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:49,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c6340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49, skipping insertion in model container [2025-03-04 06:55:49,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:49,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:49,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:49,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:49,286 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:49,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49 WrapperNode [2025-03-04 06:55:49,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:49,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:49,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:49,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:49,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,313 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 322 [2025-03-04 06:55:49,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:49,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:49,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:49,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:49,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:49,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:49,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:49,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:49,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (1/1) ... [2025-03-04 06:55:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:49,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:55:49,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:55:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:49,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:49,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:49,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:49,390 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:49,457 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:49,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:49,820 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:49,820 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:49,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:50,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:50,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50 BoogieIcfgContainer [2025-03-04 06:55:50,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:50,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:50,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:50,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:50,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:49" (1/3) ... [2025-03-04 06:55:50,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54649413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:50, skipping insertion in model container [2025-03-04 06:55:50,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:49" (2/3) ... [2025-03-04 06:55:50,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54649413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:50, skipping insertion in model container [2025-03-04 06:55:50,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50" (3/3) ... [2025-03-04 06:55:50,009 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-04 06:55:50,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:50,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 271 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-03-04 06:55:50,023 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:50,087 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:55:50,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 280 transitions, 574 flow [2025-03-04 06:55:50,203 INFO L124 PetriNetUnfolderBase]: 10/278 cut-off events. [2025-03-04 06:55:50,205 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:55:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-03-04 06:55:50,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 280 transitions, 574 flow [2025-03-04 06:55:50,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 258 transitions, 528 flow [2025-03-04 06:55:50,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:50,239 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;@6a073847, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:50,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-04 06:55:50,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:50,245 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-04 06:55:50,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:50,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,248 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] [2025-03-04 06:55:50,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:50,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash 34991883, now seen corresponding path program 1 times [2025-03-04 06:55:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161655996] [2025-03-04 06:55:50,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 06:55:50,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 06:55:50,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161655996] [2025-03-04 06:55:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161655996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105075785] [2025-03-04 06:55:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-04 06:55:50,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 258 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-04 06:55:50,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,531 INFO L124 PetriNetUnfolderBase]: 21/390 cut-off events. [2025-03-04 06:55:50,531 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-03-04 06:55:50,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 390 events. 21/390 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1239 event pairs, 14 based on Foata normal form. 7/338 useless extension candidates. Maximal degree in co-relation 282. Up to 42 conditions per place. [2025-03-04 06:55:50,534 INFO L140 encePairwiseOnDemand]: 246/280 looper letters, 13 selfloop transitions, 2 changer transitions 3/226 dead transitions. [2025-03-04 06:55:50,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 226 transitions, 494 flow [2025-03-04 06:55:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2025-03-04 06:55:50,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2025-03-04 06:55:50,549 INFO L175 Difference]: Start difference. First operand has 257 places, 258 transitions, 528 flow. Second operand 3 states and 737 transitions. [2025-03-04 06:55:50,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 226 transitions, 494 flow [2025-03-04 06:55:50,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 486 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:55:50,559 INFO L231 Difference]: Finished difference. Result has 228 places, 223 transitions, 454 flow [2025-03-04 06:55:50,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=228, PETRI_TRANSITIONS=223} [2025-03-04 06:55:50,564 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2025-03-04 06:55:50,565 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 223 transitions, 454 flow [2025-03-04 06:55:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,566 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] [2025-03-04 06:55:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:50,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 380819991, now seen corresponding path program 1 times [2025-03-04 06:55:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-03-04 06:55:50,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:55:50,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:55:50,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-03-04 06:55:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953152650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446325108] [2025-03-04 06:55:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-04 06:55:50,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-04 06:55:50,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,698 INFO L124 PetriNetUnfolderBase]: 12/306 cut-off events. [2025-03-04 06:55:50,698 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:55:50,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 306 events. 12/306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 746 event pairs, 7 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 315. Up to 30 conditions per place. [2025-03-04 06:55:50,700 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-04 06:55:50,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 482 flow [2025-03-04 06:55:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-04 06:55:50,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-04 06:55:50,703 INFO L175 Difference]: Start difference. First operand has 228 places, 223 transitions, 454 flow. Second operand 3 states and 706 transitions. [2025-03-04 06:55:50,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 482 flow [2025-03-04 06:55:50,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,707 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2025-03-04 06:55:50,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2025-03-04 06:55:50,708 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-04 06:55:50,708 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2025-03-04 06:55:50,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,709 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] [2025-03-04 06:55:50,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:50,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -156143267, now seen corresponding path program 1 times [2025-03-04 06:55:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-04 06:55:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:55:50,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:55:50,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-04 06:55:50,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715033384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173306969] [2025-03-04 06:55:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-04 06:55:50,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-04 06:55:50,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,830 INFO L124 PetriNetUnfolderBase]: 11/327 cut-off events. [2025-03-04 06:55:50,830 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:55:50,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 327 events. 11/327 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 693 event pairs, 5 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 320. Up to 23 conditions per place. [2025-03-04 06:55:50,834 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-04 06:55:50,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2025-03-04 06:55:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-04 06:55:50,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-04 06:55:50,838 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 710 transitions. [2025-03-04 06:55:50,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2025-03-04 06:55:50,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,843 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-03-04 06:55:50,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-03-04 06:55:50,845 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2025-03-04 06:55:50,845 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-03-04 06:55:50,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,845 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] [2025-03-04 06:55:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:50,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1713363755, now seen corresponding path program 1 times [2025-03-04 06:55:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795129405] [2025-03-04 06:55:50,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 06:55:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 06:55:50,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:50,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795129405] [2025-03-04 06:55:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795129405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:50,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996633495] [2025-03-04 06:55:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:50,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:50,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:50,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:50,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-04 06:55:50,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:50,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-04 06:55:50,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:50,977 INFO L124 PetriNetUnfolderBase]: 11/326 cut-off events. [2025-03-04 06:55:50,977 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-04 06:55:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 326 events. 11/326 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 691 event pairs, 5 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 311. Up to 23 conditions per place. [2025-03-04 06:55:50,979 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-04 06:55:50,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 474 flow [2025-03-04 06:55:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-04 06:55:50,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-04 06:55:50,984 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 710 transitions. [2025-03-04 06:55:50,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 474 flow [2025-03-04 06:55:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 220 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:50,987 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 448 flow [2025-03-04 06:55:50,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-04 06:55:50,989 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-04 06:55:50,989 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 448 flow [2025-03-04 06:55:50,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:50,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:50,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:50,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1303020191, now seen corresponding path program 1 times [2025-03-04 06:55:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729674612] [2025-03-04 06:55:50,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:50,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:55:51,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:55:51,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729674612] [2025-03-04 06:55:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729674612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596153582] [2025-03-04 06:55:51,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-04 06:55:51,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-04 06:55:51,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,079 INFO L124 PetriNetUnfolderBase]: 11/328 cut-off events. [2025-03-04 06:55:51,079 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-04 06:55:51,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 328 events. 11/328 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 700 event pairs, 2 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 305. Up to 14 conditions per place. [2025-03-04 06:55:51,081 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-04 06:55:51,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 223 transitions, 483 flow [2025-03-04 06:55:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-03-04 06:55:51,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2025-03-04 06:55:51,083 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 448 flow. Second operand 3 states and 723 transitions. [2025-03-04 06:55:51,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 223 transitions, 483 flow [2025-03-04 06:55:51,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 223 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:51,086 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 452 flow [2025-03-04 06:55:51,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-04 06:55:51,087 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-04 06:55:51,087 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 452 flow [2025-03-04 06:55:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,088 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-04 06:55:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:51,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:51,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1741091386, now seen corresponding path program 1 times [2025-03-04 06:55:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-03-04 06:55:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:55:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:55:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-03-04 06:55:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817258622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352274830] [2025-03-04 06:55:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-04 06:55:51,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-04 06:55:51,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,210 INFO L124 PetriNetUnfolderBase]: 11/327 cut-off events. [2025-03-04 06:55:51,211 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-04 06:55:51,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 327 events. 11/327 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 701 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 168. Up to 25 conditions per place. [2025-03-04 06:55:51,213 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-03-04 06:55:51,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 219 transitions, 476 flow [2025-03-04 06:55:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-04 06:55:51,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-04 06:55:51,215 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 452 flow. Second operand 3 states and 712 transitions. [2025-03-04 06:55:51,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 219 transitions, 476 flow [2025-03-04 06:55:51,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:51,218 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 452 flow [2025-03-04 06:55:51,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2025-03-04 06:55:51,219 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-04 06:55:51,219 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 452 flow [2025-03-04 06:55:51,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:51,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:51,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1465841358, now seen corresponding path program 1 times [2025-03-04 06:55:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174597123] [2025-03-04 06:55:51,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:55:51,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:55:51,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174597123] [2025-03-04 06:55:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174597123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106743586] [2025-03-04 06:55:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-04 06:55:51,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-04 06:55:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,330 INFO L124 PetriNetUnfolderBase]: 11/326 cut-off events. [2025-03-04 06:55:51,331 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-04 06:55:51,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 326 events. 11/326 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 696 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 304. Up to 23 conditions per place. [2025-03-04 06:55:51,332 INFO L140 encePairwiseOnDemand]: 278/280 looper letters, 10 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2025-03-04 06:55:51,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 218 transitions, 472 flow [2025-03-04 06:55:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-04 06:55:51,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559523809523809 [2025-03-04 06:55:51,334 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 452 flow. Second operand 3 states and 719 transitions. [2025-03-04 06:55:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 218 transitions, 472 flow [2025-03-04 06:55:51,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 218 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:51,337 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 448 flow [2025-03-04 06:55:51,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-03-04 06:55:51,339 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -36 predicate places. [2025-03-04 06:55:51,339 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 448 flow [2025-03-04 06:55:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:51,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:51,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:51,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1412077257, now seen corresponding path program 1 times [2025-03-04 06:55:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483333978] [2025-03-04 06:55:51,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:55:51,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:55:51,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483333978] [2025-03-04 06:55:51,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483333978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:51,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963655766] [2025-03-04 06:55:51,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:51,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:51,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-04 06:55:51,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-04 06:55:51,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,895 INFO L124 PetriNetUnfolderBase]: 11/325 cut-off events. [2025-03-04 06:55:51,895 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-04 06:55:51,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 325 events. 11/325 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 688 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 313. Up to 30 conditions per place. [2025-03-04 06:55:51,897 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 16 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-04 06:55:51,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 217 transitions, 488 flow [2025-03-04 06:55:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2025-03-04 06:55:51,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8196428571428571 [2025-03-04 06:55:51,902 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 448 flow. Second operand 6 states and 1377 transitions. [2025-03-04 06:55:51,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 217 transitions, 488 flow [2025-03-04 06:55:51,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 217 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:51,905 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 455 flow [2025-03-04 06:55:51,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-03-04 06:55:51,906 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-04 06:55:51,906 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 455 flow [2025-03-04 06:55:51,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:51,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:51,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -56696626, now seen corresponding path program 1 times [2025-03-04 06:55:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338931779] [2025-03-04 06:55:51,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:55:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:55:51,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338931779] [2025-03-04 06:55:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338931779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405845349] [2025-03-04 06:55:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-04 06:55:51,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:51,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-04 06:55:51,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:51,991 INFO L124 PetriNetUnfolderBase]: 11/324 cut-off events. [2025-03-04 06:55:51,991 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-04 06:55:51,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 324 events. 11/324 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 682 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 354. Up to 25 conditions per place. [2025-03-04 06:55:51,993 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-03-04 06:55:51,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 216 transitions, 479 flow [2025-03-04 06:55:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-04 06:55:51,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-04 06:55:51,995 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 455 flow. Second operand 3 states and 712 transitions. [2025-03-04 06:55:51,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 216 transitions, 479 flow [2025-03-04 06:55:51,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 469 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:51,998 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 447 flow [2025-03-04 06:55:51,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2025-03-04 06:55:51,999 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -37 predicate places. [2025-03-04 06:55:51,999 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 447 flow [2025-03-04 06:55:52,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:52,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash -556772360, now seen corresponding path program 1 times [2025-03-04 06:55:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29510870] [2025-03-04 06:55:52,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:55:52,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:55:52,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29510870] [2025-03-04 06:55:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29510870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119004414] [2025-03-04 06:55:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-04 06:55:52,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-04 06:55:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,080 INFO L124 PetriNetUnfolderBase]: 19/302 cut-off events. [2025-03-04 06:55:52,080 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:55:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 302 events. 19/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 740 event pairs, 9 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 302. Up to 38 conditions per place. [2025-03-04 06:55:52,081 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 12 selfloop transitions, 1 changer transitions 2/213 dead transitions. [2025-03-04 06:55:52,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 469 flow [2025-03-04 06:55:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-04 06:55:52,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-04 06:55:52,083 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 447 flow. Second operand 3 states and 706 transitions. [2025-03-04 06:55:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 469 flow [2025-03-04 06:55:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,086 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 435 flow [2025-03-04 06:55:52,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2025-03-04 06:55:52,087 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -40 predicate places. [2025-03-04 06:55:52,087 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 435 flow [2025-03-04 06:55:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:52,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1506545701, now seen corresponding path program 1 times [2025-03-04 06:55:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342259257] [2025-03-04 06:55:52,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:55:52,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:55:52,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342259257] [2025-03-04 06:55:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342259257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375096776] [2025-03-04 06:55:52,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 280 [2025-03-04 06:55:52,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 280 [2025-03-04 06:55:52,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,215 INFO L124 PetriNetUnfolderBase]: 33/377 cut-off events. [2025-03-04 06:55:52,215 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-04 06:55:52,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 377 events. 33/377 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1208 event pairs, 9 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 413. Up to 38 conditions per place. [2025-03-04 06:55:52,217 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 14 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-03-04 06:55:52,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 478 flow [2025-03-04 06:55:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-03-04 06:55:52,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2025-03-04 06:55:52,218 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 435 flow. Second operand 3 states and 707 transitions. [2025-03-04 06:55:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 478 flow [2025-03-04 06:55:52,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:52,224 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 438 flow [2025-03-04 06:55:52,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-03-04 06:55:52,225 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -44 predicate places. [2025-03-04 06:55:52,225 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 438 flow [2025-03-04 06:55:52,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:52,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash -386411138, now seen corresponding path program 1 times [2025-03-04 06:55:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832445201] [2025-03-04 06:55:52,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 06:55:52,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 06:55:52,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832445201] [2025-03-04 06:55:52,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832445201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784625718] [2025-03-04 06:55:52,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-04 06:55:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-04 06:55:52,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,346 INFO L124 PetriNetUnfolderBase]: 54/500 cut-off events. [2025-03-04 06:55:52,347 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:55:52,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 500 events. 54/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1975 event pairs, 10 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 588. Up to 87 conditions per place. [2025-03-04 06:55:52,351 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 19 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-03-04 06:55:52,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 212 transitions, 493 flow [2025-03-04 06:55:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-04 06:55:52,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-04 06:55:52,353 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 438 flow. Second operand 3 states and 714 transitions. [2025-03-04 06:55:52,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 212 transitions, 493 flow [2025-03-04 06:55:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 212 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,356 INFO L231 Difference]: Finished difference. Result has 211 places, 208 transitions, 443 flow [2025-03-04 06:55:52,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=208} [2025-03-04 06:55:52,358 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-04 06:55:52,358 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 208 transitions, 443 flow [2025-03-04 06:55:52,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:52,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1003222198, now seen corresponding path program 1 times [2025-03-04 06:55:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50520788] [2025-03-04 06:55:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:55:52,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:55:52,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50520788] [2025-03-04 06:55:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50520788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175196238] [2025-03-04 06:55:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-04 06:55:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 208 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-04 06:55:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,472 INFO L124 PetriNetUnfolderBase]: 67/488 cut-off events. [2025-03-04 06:55:52,472 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-04 06:55:52,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 488 events. 67/488 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1994 event pairs, 26 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 592. Up to 100 conditions per place. [2025-03-04 06:55:52,474 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 16 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-03-04 06:55:52,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 484 flow [2025-03-04 06:55:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-04 06:55:52,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-04 06:55:52,476 INFO L175 Difference]: Start difference. First operand has 211 places, 208 transitions, 443 flow. Second operand 3 states and 714 transitions. [2025-03-04 06:55:52,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 484 flow [2025-03-04 06:55:52,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:52,479 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2025-03-04 06:55:52,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2025-03-04 06:55:52,479 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -45 predicate places. [2025-03-04 06:55:52,479 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2025-03-04 06:55:52,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:52,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1469974723, now seen corresponding path program 1 times [2025-03-04 06:55:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900219334] [2025-03-04 06:55:52,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:55:52,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:55:52,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900219334] [2025-03-04 06:55:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900219334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694694894] [2025-03-04 06:55:52,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-04 06:55:52,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-04 06:55:52,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,618 INFO L124 PetriNetUnfolderBase]: 57/447 cut-off events. [2025-03-04 06:55:52,618 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-03-04 06:55:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 447 events. 57/447 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1665 event pairs, 23 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 566. Up to 81 conditions per place. [2025-03-04 06:55:52,621 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2025-03-04 06:55:52,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2025-03-04 06:55:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-04 06:55:52,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-04 06:55:52,623 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 711 transitions. [2025-03-04 06:55:52,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2025-03-04 06:55:52,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,627 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2025-03-04 06:55:52,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-03-04 06:55:52,628 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-04 06:55:52,629 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2025-03-04 06:55:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:52,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash 221973975, now seen corresponding path program 1 times [2025-03-04 06:55:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521030085] [2025-03-04 06:55:52,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 06:55:52,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 06:55:52,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521030085] [2025-03-04 06:55:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521030085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143950037] [2025-03-04 06:55:52,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-04 06:55:52,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-04 06:55:52,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,746 INFO L124 PetriNetUnfolderBase]: 57/444 cut-off events. [2025-03-04 06:55:52,746 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2025-03-04 06:55:52,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 444 events. 57/444 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1635 event pairs, 23 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 563. Up to 81 conditions per place. [2025-03-04 06:55:52,748 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-03-04 06:55:52,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 490 flow [2025-03-04 06:55:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-04 06:55:52,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-04 06:55:52,750 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 711 transitions. [2025-03-04 06:55:52,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 490 flow [2025-03-04 06:55:52,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,754 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2025-03-04 06:55:52,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-03-04 06:55:52,755 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -47 predicate places. [2025-03-04 06:55:52,755 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2025-03-04 06:55:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:52,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash -664092540, now seen corresponding path program 1 times [2025-03-04 06:55:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635061609] [2025-03-04 06:55:52,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:52,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:52,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635061609] [2025-03-04 06:55:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635061609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681614056] [2025-03-04 06:55:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-04 06:55:52,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-04 06:55:52,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,872 INFO L124 PetriNetUnfolderBase]: 62/470 cut-off events. [2025-03-04 06:55:52,873 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-03-04 06:55:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 470 events. 62/470 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1829 event pairs, 19 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 562. Up to 69 conditions per place. [2025-03-04 06:55:52,875 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 13 selfloop transitions, 2 changer transitions 4/206 dead transitions. [2025-03-04 06:55:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 476 flow [2025-03-04 06:55:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-04 06:55:52,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-04 06:55:52,877 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 3 states and 713 transitions. [2025-03-04 06:55:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 476 flow [2025-03-04 06:55:52,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 206 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,880 INFO L231 Difference]: Finished difference. Result has 208 places, 199 transitions, 429 flow [2025-03-04 06:55:52,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=208, PETRI_TRANSITIONS=199} [2025-03-04 06:55:52,881 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -49 predicate places. [2025-03-04 06:55:52,881 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 429 flow [2025-03-04 06:55:52,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:52,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:52,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash 772488966, now seen corresponding path program 1 times [2025-03-04 06:55:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359849661] [2025-03-04 06:55:52,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:55:52,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:55:52,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359849661] [2025-03-04 06:55:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359849661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698088826] [2025-03-04 06:55:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-04 06:55:52,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:52,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-04 06:55:52,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,004 INFO L124 PetriNetUnfolderBase]: 82/477 cut-off events. [2025-03-04 06:55:53,004 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-03-04 06:55:53,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 477 events. 82/477 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1940 event pairs, 29 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 622. Up to 107 conditions per place. [2025-03-04 06:55:53,007 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 15 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-04 06:55:53,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 201 transitions, 468 flow [2025-03-04 06:55:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-04 06:55:53,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-04 06:55:53,009 INFO L175 Difference]: Start difference. First operand has 208 places, 199 transitions, 429 flow. Second operand 3 states and 713 transitions. [2025-03-04 06:55:53,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 201 transitions, 468 flow [2025-03-04 06:55:53,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,011 INFO L231 Difference]: Finished difference. Result has 203 places, 198 transitions, 427 flow [2025-03-04 06:55:53,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2025-03-04 06:55:53,012 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -54 predicate places. [2025-03-04 06:55:53,012 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 427 flow [2025-03-04 06:55:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:53,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash 784958514, now seen corresponding path program 1 times [2025-03-04 06:55:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150174951] [2025-03-04 06:55:53,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 06:55:53,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 06:55:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150174951] [2025-03-04 06:55:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150174951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232123244] [2025-03-04 06:55:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-04 06:55:53,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-04 06:55:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,109 INFO L124 PetriNetUnfolderBase]: 52/434 cut-off events. [2025-03-04 06:55:53,110 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2025-03-04 06:55:53,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 434 events. 52/434 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1575 event pairs, 12 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 523. Up to 50 conditions per place. [2025-03-04 06:55:53,112 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 11 selfloop transitions, 2 changer transitions 4/199 dead transitions. [2025-03-04 06:55:53,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 460 flow [2025-03-04 06:55:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-03-04 06:55:53,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2025-03-04 06:55:53,114 INFO L175 Difference]: Start difference. First operand has 203 places, 198 transitions, 427 flow. Second operand 3 states and 715 transitions. [2025-03-04 06:55:53,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 460 flow [2025-03-04 06:55:53,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 199 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,116 INFO L231 Difference]: Finished difference. Result has 201 places, 192 transitions, 414 flow [2025-03-04 06:55:53,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=201, PETRI_TRANSITIONS=192} [2025-03-04 06:55:53,117 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -56 predicate places. [2025-03-04 06:55:53,117 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 192 transitions, 414 flow [2025-03-04 06:55:53,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:53,117 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash -745277163, now seen corresponding path program 1 times [2025-03-04 06:55:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-03-04 06:55:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 06:55:53,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 06:55:53,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-03-04 06:55:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964228395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:55:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049985922] [2025-03-04 06:55:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-04 06:55:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 192 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-04 06:55:53,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,299 INFO L124 PetriNetUnfolderBase]: 24/366 cut-off events. [2025-03-04 06:55:53,300 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:55:53,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 366 events. 24/366 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 978 event pairs, 3 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 393. Up to 33 conditions per place. [2025-03-04 06:55:53,302 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 11 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2025-03-04 06:55:53,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 195 transitions, 449 flow [2025-03-04 06:55:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-03-04 06:55:53,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2025-03-04 06:55:53,304 INFO L175 Difference]: Start difference. First operand has 201 places, 192 transitions, 414 flow. Second operand 3 states and 722 transitions. [2025-03-04 06:55:53,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 195 transitions, 449 flow [2025-03-04 06:55:53,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 195 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:53,306 INFO L231 Difference]: Finished difference. Result has 198 places, 194 transitions, 429 flow [2025-03-04 06:55:53,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=198, PETRI_TRANSITIONS=194} [2025-03-04 06:55:53,307 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-04 06:55:53,307 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 194 transitions, 429 flow [2025-03-04 06:55:53,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:53,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:55:53,308 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-04 06:55:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2064496127, now seen corresponding path program 1 times [2025-03-04 06:55:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 06:55:53,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:53,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:55:53,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:55:53,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:53,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 06:55:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349513331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672420538] [2025-03-04 06:55:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:53,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:53,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-04 06:55:53,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 194 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-04 06:55:53,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:53,403 INFO L124 PetriNetUnfolderBase]: 40/381 cut-off events. [2025-03-04 06:55:53,403 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-03-04 06:55:53,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 381 events. 40/381 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1184 event pairs, 12 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 468. Up to 61 conditions per place. [2025-03-04 06:55:53,404 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 0 selfloop transitions, 0 changer transitions 196/196 dead transitions. [2025-03-04 06:55:53,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 472 flow [2025-03-04 06:55:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-04 06:55:53,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-04 06:55:53,406 INFO L175 Difference]: Start difference. First operand has 198 places, 194 transitions, 429 flow. Second operand 3 states and 714 transitions. [2025-03-04 06:55:53,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 472 flow [2025-03-04 06:55:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 196 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:53,407 INFO L231 Difference]: Finished difference. Result has 198 places, 0 transitions, 0 flow [2025-03-04 06:55:53,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=198, PETRI_TRANSITIONS=0} [2025-03-04 06:55:53,408 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-04 06:55:53,408 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 0 transitions, 0 flow [2025-03-04 06:55:53,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:53,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-04 06:55:53,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-04 06:55:53,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-04 06:55:53,412 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2025-03-04 06:55:53,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-04 06:55:53,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-04 06:55:53,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-04 06:55:53,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-04 06:55:53,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:55:53,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:53,422 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:53,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:53,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:53 BasicIcfg [2025-03-04 06:55:53,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:53,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:53,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:53,429 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:53,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:50" (3/4) ... [2025-03-04 06:55:53,431 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:53,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:53,434 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:53,438 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 06:55:53,439 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:53,439 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:55:53,439 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:53,508 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:53,508 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:53,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:53,509 INFO L158 Benchmark]: Toolchain (without parser) took 4420.97ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.0MB in the beginning and 124.0MB in the end (delta: 30.0MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2025-03-04 06:55:53,510 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:53,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.81ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 141.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:53,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 138.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:53,510 INFO L158 Benchmark]: Boogie Preprocessor took 31.64ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 136.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:53,511 INFO L158 Benchmark]: IcfgBuilder took 655.48ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 71.1MB in the end (delta: 65.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 06:55:53,511 INFO L158 Benchmark]: TraceAbstraction took 3425.73ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 132.4MB in the end (delta: -61.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:53,511 INFO L158 Benchmark]: Witness Printer took 79.30ms. Allocated memory is still 243.3MB. Free memory was 132.4MB in the beginning and 124.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:53,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.81ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 141.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 138.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.64ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 136.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 655.48ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 71.1MB in the end (delta: 65.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3425.73ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 132.4MB in the end (delta: -61.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 79.30ms. Allocated memory is still 243.3MB. Free memory was 132.4MB in the beginning and 124.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 372 locations, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 66 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1794 NumberOfCodeBlocks, 1794 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:53,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE