./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:25:44,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:25:44,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:25:44,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:25:44,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:25:44,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:25:44,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:25:44,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:25:44,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:25:44,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:25:44,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:25:44,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:25:44,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:25:44,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:25:44,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:25:44,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:25:44,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:25:44,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:25:44,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:25:44,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:25:44,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:44,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:25:44,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:25:44,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:25:44,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:25:44,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:25:44,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:25:44,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:25:44,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:25:44,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:25:44,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:25:44,722 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-03-13 22:25:44,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:25:44,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:25:44,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:25:44,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:25:44,946 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:25:44,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-13 22:25:46,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d57d6e8/1b1c135b022f4a0b9f71732b0b20196f/FLAG10f4482dc [2025-03-13 22:25:46,328 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:25:46,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-13 22:25:46,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d57d6e8/1b1c135b022f4a0b9f71732b0b20196f/FLAG10f4482dc [2025-03-13 22:25:46,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d57d6e8/1b1c135b022f4a0b9f71732b0b20196f [2025-03-13 22:25:46,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:25:46,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:25:46,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:46,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:25:46,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:25:46,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6340505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46, skipping insertion in model container [2025-03-13 22:25:46,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:25:46,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:46,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:25:46,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:46,847 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:25:46,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46 WrapperNode [2025-03-13 22:25:46,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:46,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:46,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:25:46,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:25:46,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,883 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 359 [2025-03-13 22:25:46,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:46,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:25:46,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:25:46,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:25:46,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:25:46,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:25:46,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:25:46,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:25:46,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (1/1) ... [2025-03-13 22:25:46,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:25:46,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:25:46,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:25:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:25:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:25:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:25:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:25:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:25:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:25:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:25:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:25:46,971 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:25:47,041 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:25:47,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:25:47,532 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:25:47,533 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:25:47,533 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:25:47,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:25:47,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:47 BoogieIcfgContainer [2025-03-13 22:25:47,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:25:47,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:25:47,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:25:47,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:25:47,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:46" (1/3) ... [2025-03-13 22:25:47,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d0da87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:47, skipping insertion in model container [2025-03-13 22:25:47,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:46" (2/3) ... [2025-03-13 22:25:47,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d0da87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:47, skipping insertion in model container [2025-03-13 22:25:47,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:47" (3/3) ... [2025-03-13 22:25:47,575 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-03-13 22:25:47,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:25:47,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 474 locations, 1 initial locations, 5 loop locations, and 30 error locations. [2025-03-13 22:25:47,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:25:47,716 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:25:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 500 transitions, 1021 flow [2025-03-13 22:25:47,903 INFO L124 PetriNetUnfolderBase]: 27/497 cut-off events. [2025-03-13 22:25:47,905 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:25:47,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 497 events. 27/497 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1039 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 380. Up to 2 conditions per place. [2025-03-13 22:25:47,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 483 places, 500 transitions, 1021 flow [2025-03-13 22:25:47,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 464 places, 480 transitions, 978 flow [2025-03-13 22:25:47,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:25:47,946 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;@ca3cbf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:25:47,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-13 22:25:47,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:25:47,952 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-13 22:25:47,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:25:47,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:47,953 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] [2025-03-13 22:25:47,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -79264842, now seen corresponding path program 1 times [2025-03-13 22:25:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85596177] [2025-03-13 22:25:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:48,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:25:48,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:25:48,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:48,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85596177] [2025-03-13 22:25:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85596177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:48,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601911873] [2025-03-13 22:25:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:48,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:48,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:48,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:48,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 500 [2025-03-13 22:25:48,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 480 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 460.3333333333333) internal successors, (1381), 3 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:48,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:48,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 500 [2025-03-13 22:25:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:48,416 INFO L124 PetriNetUnfolderBase]: 36/1189 cut-off events. [2025-03-13 22:25:48,416 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-13 22:25:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1189 events. 36/1189 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5525 event pairs, 20 based on Foata normal form. 101/1149 useless extension candidates. Maximal degree in co-relation 979. Up to 58 conditions per place. [2025-03-13 22:25:48,428 INFO L140 encePairwiseOnDemand]: 477/500 looper letters, 15 selfloop transitions, 2 changer transitions 5/459 dead transitions. [2025-03-13 22:25:48,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 459 transitions, 970 flow [2025-03-13 22:25:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1415 transitions. [2025-03-13 22:25:48,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433333333333334 [2025-03-13 22:25:48,443 INFO L175 Difference]: Start difference. First operand has 464 places, 480 transitions, 978 flow. Second operand 3 states and 1415 transitions. [2025-03-13 22:25:48,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 459 transitions, 970 flow [2025-03-13 22:25:48,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 459 transitions, 958 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:25:48,461 INFO L231 Difference]: Finished difference. Result has 459 places, 454 transitions, 918 flow [2025-03-13 22:25:48,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=459, PETRI_TRANSITIONS=454} [2025-03-13 22:25:48,468 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -5 predicate places. [2025-03-13 22:25:48,469 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 454 transitions, 918 flow [2025-03-13 22:25:48,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 460.3333333333333) internal successors, (1381), 3 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:48,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:48,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:48,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:25:48,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 880253268, now seen corresponding path program 1 times [2025-03-13 22:25:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380767654] [2025-03-13 22:25:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:48,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:25:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:25:48,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:48,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-13 22:25:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380767654] [2025-03-13 22:25:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380767654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831466339] [2025-03-13 22:25:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:48,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:48,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:48,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 500 [2025-03-13 22:25:48,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 454 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:48,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:48,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 500 [2025-03-13 22:25:48,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:48,746 INFO L124 PetriNetUnfolderBase]: 39/1139 cut-off events. [2025-03-13 22:25:48,746 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:25:48,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 1139 events. 39/1139 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5027 event pairs, 23 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1187. Up to 66 conditions per place. [2025-03-13 22:25:48,761 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 16 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2025-03-13 22:25:48,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 952 flow [2025-03-13 22:25:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1393 transitions. [2025-03-13 22:25:48,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286666666666666 [2025-03-13 22:25:48,764 INFO L175 Difference]: Start difference. First operand has 459 places, 454 transitions, 918 flow. Second operand 3 states and 1393 transitions. [2025-03-13 22:25:48,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 952 flow [2025-03-13 22:25:48,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:48,771 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 916 flow [2025-03-13 22:25:48,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2025-03-13 22:25:48,772 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -11 predicate places. [2025-03-13 22:25:48,772 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 916 flow [2025-03-13 22:25:48,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:48,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:48,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:25:48,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:48,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1831804540, now seen corresponding path program 1 times [2025-03-13 22:25:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735196147] [2025-03-13 22:25:48,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:48,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:25:48,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:25:48,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:48,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:48,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735196147] [2025-03-13 22:25:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735196147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:48,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777319745] [2025-03-13 22:25:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:48,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:48,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 500 [2025-03-13 22:25:48,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 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-13 22:25:48,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:48,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 500 [2025-03-13 22:25:48,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:49,059 INFO L124 PetriNetUnfolderBase]: 68/1410 cut-off events. [2025-03-13 22:25:49,059 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:25:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 1410 events. 68/1410 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7406 event pairs, 45 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1498. Up to 111 conditions per place. [2025-03-13 22:25:49,076 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2025-03-13 22:25:49,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 448 transitions, 944 flow [2025-03-13 22:25:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1386 transitions. [2025-03-13 22:25:49,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924 [2025-03-13 22:25:49,080 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 916 flow. Second operand 3 states and 1386 transitions. [2025-03-13 22:25:49,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 448 transitions, 944 flow [2025-03-13 22:25:49,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:49,087 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 904 flow [2025-03-13 22:25:49,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-03-13 22:25:49,089 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -16 predicate places. [2025-03-13 22:25:49,089 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 904 flow [2025-03-13 22:25:49,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 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-13 22:25:49,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:49,090 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] [2025-03-13 22:25:49,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:25:49,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:49,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1870690529, now seen corresponding path program 1 times [2025-03-13 22:25:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:49,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68200785] [2025-03-13 22:25:49,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:25:49,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:25:49,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:49,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:49,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68200785] [2025-03-13 22:25:49,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68200785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:49,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379362021] [2025-03-13 22:25:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:49,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:49,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:49,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:49,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:49,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 500 [2025-03-13 22:25:49,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:49,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:49,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 500 [2025-03-13 22:25:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:51,786 INFO L124 PetriNetUnfolderBase]: 2314/17706 cut-off events. [2025-03-13 22:25:51,786 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-03-13 22:25:51,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21249 conditions, 17706 events. 2314/17706 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 215897 event pairs, 1879 based on Foata normal form. 0/15700 useless extension candidates. Maximal degree in co-relation 21211. Up to 3430 conditions per place. [2025-03-13 22:25:51,889 INFO L140 encePairwiseOnDemand]: 488/500 looper letters, 48 selfloop transitions, 10 changer transitions 0/446 dead transitions. [2025-03-13 22:25:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1016 flow [2025-03-13 22:25:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2568 transitions. [2025-03-13 22:25:51,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.856 [2025-03-13 22:25:51,894 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 904 flow. Second operand 6 states and 2568 transitions. [2025-03-13 22:25:51,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1016 flow [2025-03-13 22:25:51,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 446 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:51,899 INFO L231 Difference]: Finished difference. Result has 450 places, 446 transitions, 919 flow [2025-03-13 22:25:51,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=450, PETRI_TRANSITIONS=446} [2025-03-13 22:25:51,901 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -14 predicate places. [2025-03-13 22:25:51,901 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 446 transitions, 919 flow [2025-03-13 22:25:51,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:51,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:51,902 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] [2025-03-13 22:25:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:25:51,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1054026362, now seen corresponding path program 1 times [2025-03-13 22:25:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938775100] [2025-03-13 22:25:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:51,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:25:51,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:25:51,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:51,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938775100] [2025-03-13 22:25:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938775100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:51,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150926573] [2025-03-13 22:25:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:51,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:51,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:51,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:51,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500 [2025-03-13 22:25:51,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 446 transitions, 919 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:51,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:51,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500 [2025-03-13 22:25:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:52,136 INFO L124 PetriNetUnfolderBase]: 58/1292 cut-off events. [2025-03-13 22:25:52,136 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 22:25:52,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1292 events. 58/1292 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6630 event pairs, 38 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1376. Up to 93 conditions per place. [2025-03-13 22:25:52,151 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 14 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-03-13 22:25:52,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 445 transitions, 949 flow [2025-03-13 22:25:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-03-13 22:25:52,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313333333333333 [2025-03-13 22:25:52,154 INFO L175 Difference]: Start difference. First operand has 450 places, 446 transitions, 919 flow. Second operand 3 states and 1397 transitions. [2025-03-13 22:25:52,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 445 transitions, 949 flow [2025-03-13 22:25:52,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 445 transitions, 929 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:25:52,162 INFO L231 Difference]: Finished difference. Result has 446 places, 445 transitions, 901 flow [2025-03-13 22:25:52,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=446, PETRI_TRANSITIONS=445} [2025-03-13 22:25:52,165 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -18 predicate places. [2025-03-13 22:25:52,165 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 901 flow [2025-03-13 22:25:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:52,168 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] [2025-03-13 22:25:52,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:25:52,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1504494366, now seen corresponding path program 1 times [2025-03-13 22:25:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-13 22:25:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:52,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-13 22:25:52,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-13 22:25:52,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:52,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:52,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:52,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395439932] [2025-03-13 22:25:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395439932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072770123] [2025-03-13 22:25:52,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:52,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:52,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:52,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:52,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500 [2025-03-13 22:25:52,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:52,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500 [2025-03-13 22:25:52,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:52,446 INFO L124 PetriNetUnfolderBase]: 50/1051 cut-off events. [2025-03-13 22:25:52,446 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 22:25:52,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1051 events. 50/1051 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4838 event pairs, 38 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1109. Up to 81 conditions per place. [2025-03-13 22:25:52,458 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 14 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-03-13 22:25:52,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 444 transitions, 931 flow [2025-03-13 22:25:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-03-13 22:25:52,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313333333333333 [2025-03-13 22:25:52,461 INFO L175 Difference]: Start difference. First operand has 446 places, 445 transitions, 901 flow. Second operand 3 states and 1397 transitions. [2025-03-13 22:25:52,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 444 transitions, 931 flow [2025-03-13 22:25:52,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 444 transitions, 927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:52,466 INFO L231 Difference]: Finished difference. Result has 445 places, 444 transitions, 899 flow [2025-03-13 22:25:52,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=444} [2025-03-13 22:25:52,468 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -19 predicate places. [2025-03-13 22:25:52,468 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 444 transitions, 899 flow [2025-03-13 22:25:52,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:52,469 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] [2025-03-13 22:25:52,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:25:52,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:52,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1611681059, now seen corresponding path program 1 times [2025-03-13 22:25:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259373180] [2025-03-13 22:25:52,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:52,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-13 22:25:52,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-13 22:25:52,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:52,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259373180] [2025-03-13 22:25:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259373180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802911110] [2025-03-13 22:25:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:52,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:52,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:52,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 500 [2025-03-13 22:25:52,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:52,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 500 [2025-03-13 22:25:52,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:52,736 INFO L124 PetriNetUnfolderBase]: 61/1443 cut-off events. [2025-03-13 22:25:52,736 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-13 22:25:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 1443 events. 61/1443 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7857 event pairs, 39 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1510. Up to 93 conditions per place. [2025-03-13 22:25:52,750 INFO L140 encePairwiseOnDemand]: 495/500 looper letters, 16 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2025-03-13 22:25:52,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 440 transitions, 925 flow [2025-03-13 22:25:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-13 22:25:52,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.928 [2025-03-13 22:25:52,753 INFO L175 Difference]: Start difference. First operand has 445 places, 444 transitions, 899 flow. Second operand 3 states and 1392 transitions. [2025-03-13 22:25:52,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 440 transitions, 925 flow [2025-03-13 22:25:52,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 440 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:52,758 INFO L231 Difference]: Finished difference. Result has 441 places, 440 transitions, 889 flow [2025-03-13 22:25:52,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=441, PETRI_TRANSITIONS=440} [2025-03-13 22:25:52,760 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2025-03-13 22:25:52,760 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 440 transitions, 889 flow [2025-03-13 22:25:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:52,761 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-13 22:25:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:25:52,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash -916711640, now seen corresponding path program 1 times [2025-03-13 22:25:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140813787] [2025-03-13 22:25:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:52,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-13 22:25:52,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-13 22:25:52,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:52,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:52,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:52,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140813787] [2025-03-13 22:25:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140813787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604936010] [2025-03-13 22:25:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:52,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:52,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:52,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 500 [2025-03-13 22:25:52,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 440 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:52,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:52,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 500 [2025-03-13 22:25:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:52,987 INFO L124 PetriNetUnfolderBase]: 41/1274 cut-off events. [2025-03-13 22:25:52,987 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:25:52,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1274 events. 41/1274 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5261 event pairs, 15 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 1321. Up to 37 conditions per place. [2025-03-13 22:25:52,997 INFO L140 encePairwiseOnDemand]: 495/500 looper letters, 12 selfloop transitions, 2 changer transitions 2/442 dead transitions. [2025-03-13 22:25:53,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 442 transitions, 927 flow [2025-03-13 22:25:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-03-13 22:25:53,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938 [2025-03-13 22:25:53,003 INFO L175 Difference]: Start difference. First operand has 441 places, 440 transitions, 889 flow. Second operand 3 states and 1407 transitions. [2025-03-13 22:25:53,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 442 transitions, 927 flow [2025-03-13 22:25:53,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 442 transitions, 926 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:53,008 INFO L231 Difference]: Finished difference. Result has 440 places, 436 transitions, 883 flow [2025-03-13 22:25:53,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=440, PETRI_TRANSITIONS=436} [2025-03-13 22:25:53,011 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -24 predicate places. [2025-03-13 22:25:53,011 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 436 transitions, 883 flow [2025-03-13 22:25:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:53,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25: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] [2025-03-13 22:25:53,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:25:53,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:53,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -491558647, now seen corresponding path program 1 times [2025-03-13 22:25:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127534686] [2025-03-13 22:25:53,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-13 22:25:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-13 22:25:53,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127534686] [2025-03-13 22:25:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127534686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:53,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142177757] [2025-03-13 22:25:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:53,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:53,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:53,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500 [2025-03-13 22:25:53,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 436 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:53,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:53,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500 [2025-03-13 22:25:53,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:53,373 INFO L124 PetriNetUnfolderBase]: 185/3164 cut-off events. [2025-03-13 22:25:53,374 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 22:25:53,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 3164 events. 185/3164 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 24596 event pairs, 48 based on Foata normal form. 0/2850 useless extension candidates. Maximal degree in co-relation 3426. Up to 262 conditions per place. [2025-03-13 22:25:53,400 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 3 changer transitions 0/440 dead transitions. [2025-03-13 22:25:53,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 440 transitions, 937 flow [2025-03-13 22:25:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-13 22:25:53,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936 [2025-03-13 22:25:53,405 INFO L175 Difference]: Start difference. First operand has 440 places, 436 transitions, 883 flow. Second operand 3 states and 1404 transitions. [2025-03-13 22:25:53,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 440 transitions, 937 flow [2025-03-13 22:25:53,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 440 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:53,412 INFO L231 Difference]: Finished difference. Result has 436 places, 436 transitions, 894 flow [2025-03-13 22:25:53,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=436, PETRI_TRANSITIONS=436} [2025-03-13 22:25:53,414 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -28 predicate places. [2025-03-13 22:25:53,414 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 436 transitions, 894 flow [2025-03-13 22:25:53,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:53,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:53,415 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] [2025-03-13 22:25:53,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:25:53,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash -207417588, now seen corresponding path program 1 times [2025-03-13 22:25:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273597282] [2025-03-13 22:25:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-13 22:25:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-13 22:25:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273597282] [2025-03-13 22:25:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273597282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:25:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593669796] [2025-03-13 22:25:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:25:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:53,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:25:53,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:25:53,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 500 [2025-03-13 22:25:53,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 436 transitions, 894 flow. Second operand has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:53,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:53,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 500 [2025-03-13 22:25:53,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:54,452 INFO L124 PetriNetUnfolderBase]: 164/3595 cut-off events. [2025-03-13 22:25:54,453 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:25:54,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 3595 events. 164/3595 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25617 event pairs, 67 based on Foata normal form. 8/3274 useless extension candidates. Maximal degree in co-relation 3924. Up to 148 conditions per place. [2025-03-13 22:25:54,485 INFO L140 encePairwiseOnDemand]: 479/500 looper letters, 35 selfloop transitions, 28 changer transitions 0/468 dead transitions. [2025-03-13 22:25:54,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 468 transitions, 1091 flow [2025-03-13 22:25:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:25:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:25:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4524 transitions. [2025-03-13 22:25:54,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048 [2025-03-13 22:25:54,494 INFO L175 Difference]: Start difference. First operand has 436 places, 436 transitions, 894 flow. Second operand 10 states and 4524 transitions. [2025-03-13 22:25:54,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 468 transitions, 1091 flow [2025-03-13 22:25:54,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 468 transitions, 1091 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:25:54,500 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 1023 flow [2025-03-13 22:25:54,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1023, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-03-13 22:25:54,502 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -15 predicate places. [2025-03-13 22:25:54,502 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 1023 flow [2025-03-13 22:25:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:54,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:54,504 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] [2025-03-13 22:25:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:25:54,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -815382832, now seen corresponding path program 1 times [2025-03-13 22:25:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837725652] [2025-03-13 22:25:54,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-13 22:25:54,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-13 22:25:54,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:54,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:54,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837725652] [2025-03-13 22:25:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837725652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274503490] [2025-03-13 22:25:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:54,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:25:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:54,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:25:54,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:25:54,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 500 [2025-03-13 22:25:54,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 459.0) internal successors, (2295), 5 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:54,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:54,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 500 [2025-03-13 22:25:54,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:55,045 INFO L124 PetriNetUnfolderBase]: 200/2722 cut-off events. [2025-03-13 22:25:55,045 INFO L125 PetriNetUnfolderBase]: For 99/108 co-relation queries the response was YES. [2025-03-13 22:25:55,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 2722 events. 200/2722 cut-off events. For 99/108 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 19283 event pairs, 85 based on Foata normal form. 12/2478 useless extension candidates. Maximal degree in co-relation 3168. Up to 212 conditions per place. [2025-03-13 22:25:55,074 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 0/464 dead transitions. [2025-03-13 22:25:55,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 464 transitions, 1116 flow [2025-03-13 22:25:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:25:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:25:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2317 transitions. [2025-03-13 22:25:55,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268 [2025-03-13 22:25:55,078 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 1023 flow. Second operand 5 states and 2317 transitions. [2025-03-13 22:25:55,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 464 transitions, 1116 flow [2025-03-13 22:25:55,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 464 transitions, 1116 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:25:55,084 INFO L231 Difference]: Finished difference. Result has 455 places, 454 transitions, 1048 flow [2025-03-13 22:25:55,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1048, PETRI_PLACES=455, PETRI_TRANSITIONS=454} [2025-03-13 22:25:55,085 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2025-03-13 22:25:55,085 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 1048 flow [2025-03-13 22:25:55,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 459.0) internal successors, (2295), 5 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:55,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:55,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:55,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:25:55,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:55,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1715527604, now seen corresponding path program 1 times [2025-03-13 22:25:55,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848308476] [2025-03-13 22:25:55,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:55,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:55,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-13 22:25:55,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-13 22:25:55,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848308476] [2025-03-13 22:25:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848308476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:55,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:55,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393486124] [2025-03-13 22:25:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:55,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:55,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:55,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:25:55,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 1048 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:55,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:55,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:25:55,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:56,057 INFO L124 PetriNetUnfolderBase]: 250/3099 cut-off events. [2025-03-13 22:25:56,057 INFO L125 PetriNetUnfolderBase]: For 230/241 co-relation queries the response was YES. [2025-03-13 22:25:56,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 3099 events. 250/3099 cut-off events. For 230/241 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22208 event pairs, 71 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 3759. Up to 243 conditions per place. [2025-03-13 22:25:56,090 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 34 selfloop transitions, 5 changer transitions 0/465 dead transitions. [2025-03-13 22:25:56,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 465 transitions, 1156 flow [2025-03-13 22:25:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions. [2025-03-13 22:25:56,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-03-13 22:25:56,093 INFO L175 Difference]: Start difference. First operand has 455 places, 454 transitions, 1048 flow. Second operand 6 states and 2744 transitions. [2025-03-13 22:25:56,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 465 transitions, 1156 flow [2025-03-13 22:25:56,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 465 transitions, 1151 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:56,099 INFO L231 Difference]: Finished difference. Result has 457 places, 453 transitions, 1051 flow [2025-03-13 22:25:56,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=457, PETRI_TRANSITIONS=453} [2025-03-13 22:25:56,100 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -7 predicate places. [2025-03-13 22:25:56,100 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 453 transitions, 1051 flow [2025-03-13 22:25:56,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:56,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:56,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:25:56,101 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 645449325, now seen corresponding path program 1 times [2025-03-13 22:25:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:56,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642806540] [2025-03-13 22:25:56,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:56,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:56,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-13 22:25:56,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-13 22:25:56,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642806540] [2025-03-13 22:25:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642806540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329700327] [2025-03-13 22:25:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:56,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:56,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:56,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500 [2025-03-13 22:25:56,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 453 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 461.6666666666667) internal successors, (1385), 3 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:56,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:56,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500 [2025-03-13 22:25:56,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:57,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][226], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 157#L65-31true, 304#L86-1true, 148#L56-31true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 545#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:25:57,026 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-13 22:25:57,026 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:57,026 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is cut-off event [2025-03-13 22:25:57,026 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:57,062 INFO L124 PetriNetUnfolderBase]: 384/7928 cut-off events. [2025-03-13 22:25:57,062 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 22:25:57,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8879 conditions, 7928 events. 384/7928 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 76231 event pairs, 98 based on Foata normal form. 0/7299 useless extension candidates. Maximal degree in co-relation 8830. Up to 490 conditions per place. [2025-03-13 22:25:57,114 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 3 changer transitions 0/457 dead transitions. [2025-03-13 22:25:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 457 transitions, 1105 flow [2025-03-13 22:25:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions. [2025-03-13 22:25:57,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936 [2025-03-13 22:25:57,116 INFO L175 Difference]: Start difference. First operand has 457 places, 453 transitions, 1051 flow. Second operand 3 states and 1404 transitions. [2025-03-13 22:25:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 457 transitions, 1105 flow [2025-03-13 22:25:57,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 457 transitions, 1095 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:25:57,122 INFO L231 Difference]: Finished difference. Result has 452 places, 453 transitions, 1056 flow [2025-03-13 22:25:57,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=452, PETRI_TRANSITIONS=453} [2025-03-13 22:25:57,123 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -12 predicate places. [2025-03-13 22:25:57,123 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 453 transitions, 1056 flow [2025-03-13 22:25:57,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.6666666666667) internal successors, (1385), 3 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:57,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:25:57,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:57,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1953782133, now seen corresponding path program 1 times [2025-03-13 22:25:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:57,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-03-13 22:25:57,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:57,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-13 22:25:57,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-13 22:25:57,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:57,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:57,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-03-13 22:25:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754897429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:57,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985618833] [2025-03-13 22:25:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:57,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:57,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:57,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:25:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 453 transitions, 1056 flow. Second operand has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:57,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:25:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:58,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][228], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 157#L65-31true, 494#(= |#race~N~0| 0), 555#true, 304#L86-1true, Black: 551#true, 148#L56-31true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:25:58,319 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2025-03-13 22:25:58,319 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:58,319 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:58,319 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-13 22:25:58,321 INFO L124 PetriNetUnfolderBase]: 475/5756 cut-off events. [2025-03-13 22:25:58,321 INFO L125 PetriNetUnfolderBase]: For 254/269 co-relation queries the response was YES. [2025-03-13 22:25:58,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 5756 events. 475/5756 cut-off events. For 254/269 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 50578 event pairs, 93 based on Foata normal form. 0/5325 useless extension candidates. Maximal degree in co-relation 6857. Up to 277 conditions per place. [2025-03-13 22:25:58,373 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 32 selfloop transitions, 5 changer transitions 0/464 dead transitions. [2025-03-13 22:25:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 464 transitions, 1160 flow [2025-03-13 22:25:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions. [2025-03-13 22:25:58,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-03-13 22:25:58,377 INFO L175 Difference]: Start difference. First operand has 452 places, 453 transitions, 1056 flow. Second operand 6 states and 2744 transitions. [2025-03-13 22:25:58,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 464 transitions, 1160 flow [2025-03-13 22:25:58,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 464 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:25:58,383 INFO L231 Difference]: Finished difference. Result has 456 places, 452 transitions, 1064 flow [2025-03-13 22:25:58,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=456, PETRI_TRANSITIONS=452} [2025-03-13 22:25:58,385 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -8 predicate places. [2025-03-13 22:25:58,385 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 452 transitions, 1064 flow [2025-03-13 22:25:58,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:58,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:58,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:25:58,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:58,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1744369360, now seen corresponding path program 1 times [2025-03-13 22:25:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102326494] [2025-03-13 22:25:58,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 22:25:58,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 22:25:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:25:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102326494] [2025-03-13 22:25:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102326494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869443029] [2025-03-13 22:25:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:58,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:58,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:58,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:58,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:25:58,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 452 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:58,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:58,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:25:58,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:59,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][225], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 157#L65-31true, 555#true, 494#(= |#race~N~0| 0), 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 561#true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:25:59,436 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-13 22:25:59,436 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:59,436 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:59,436 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:25:59,488 INFO L124 PetriNetUnfolderBase]: 317/4281 cut-off events. [2025-03-13 22:25:59,488 INFO L125 PetriNetUnfolderBase]: For 246/257 co-relation queries the response was YES. [2025-03-13 22:25:59,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5276 conditions, 4281 events. 317/4281 cut-off events. For 246/257 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 34998 event pairs, 92 based on Foata normal form. 0/3948 useless extension candidates. Maximal degree in co-relation 5225. Up to 269 conditions per place. [2025-03-13 22:25:59,530 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 34 selfloop transitions, 5 changer transitions 0/463 dead transitions. [2025-03-13 22:25:59,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 1172 flow [2025-03-13 22:25:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions. [2025-03-13 22:25:59,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-03-13 22:25:59,533 INFO L175 Difference]: Start difference. First operand has 456 places, 452 transitions, 1064 flow. Second operand 6 states and 2744 transitions. [2025-03-13 22:25:59,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 1172 flow [2025-03-13 22:25:59,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 463 transitions, 1162 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:25:59,539 INFO L231 Difference]: Finished difference. Result has 455 places, 451 transitions, 1062 flow [2025-03-13 22:25:59,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1062, PETRI_PLACES=455, PETRI_TRANSITIONS=451} [2025-03-13 22:25:59,540 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2025-03-13 22:25:59,540 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 451 transitions, 1062 flow [2025-03-13 22:25:59,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:59,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:59,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:25:59,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:25:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1568094553, now seen corresponding path program 1 times [2025-03-13 22:25:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953981298] [2025-03-13 22:25:59,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:59,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-13 22:25:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-13 22:25:59,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:59,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:59,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953981298] [2025-03-13 22:25:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953981298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:59,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:59,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489436139] [2025-03-13 22:25:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:59,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:00,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:26:00,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 451 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:00,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:00,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:26:00,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:00,585 INFO L124 PetriNetUnfolderBase]: 389/4673 cut-off events. [2025-03-13 22:26:00,585 INFO L125 PetriNetUnfolderBase]: For 213/228 co-relation queries the response was YES. [2025-03-13 22:26:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 4673 events. 389/4673 cut-off events. For 213/228 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 39233 event pairs, 78 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 5631. Up to 278 conditions per place. [2025-03-13 22:26:00,618 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 32 selfloop transitions, 5 changer transitions 14/462 dead transitions. [2025-03-13 22:26:00,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 462 transitions, 1166 flow [2025-03-13 22:26:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions. [2025-03-13 22:26:00,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-03-13 22:26:00,621 INFO L175 Difference]: Start difference. First operand has 455 places, 451 transitions, 1062 flow. Second operand 6 states and 2744 transitions. [2025-03-13 22:26:00,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 462 transitions, 1166 flow [2025-03-13 22:26:00,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 462 transitions, 1156 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:00,627 INFO L231 Difference]: Finished difference. Result has 454 places, 436 transitions, 989 flow [2025-03-13 22:26:00,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=989, PETRI_PLACES=454, PETRI_TRANSITIONS=436} [2025-03-13 22:26:00,627 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -10 predicate places. [2025-03-13 22:26:00,628 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 436 transitions, 989 flow [2025-03-13 22:26:00,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:00,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:00,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:00,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:00,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:26:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1134899364, now seen corresponding path program 1 times [2025-03-13 22:26:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656742309] [2025-03-13 22:26:00,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:00,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-13 22:26:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-13 22:26:00,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:26:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656742309] [2025-03-13 22:26:00,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656742309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:00,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211815173] [2025-03-13 22:26:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:00,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:00,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:01,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:26:01,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 436 transitions, 989 flow. Second operand has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:01,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:26:01,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:01,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_6|} AuxVars[] AssignedVars[#race~A~0][224], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 157#L65-31true, 494#(= |#race~N~0| 0), 304#L86-1true, Black: 551#true, 148#L56-31true, 567#true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:26:01,599 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is cut-off event [2025-03-13 22:26:01,599 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:01,600 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:01,600 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:01,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9) InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} AuxVars[] AssignedVars[~res2~0][436], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 572#(and (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)) 0)), 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 494#(= |#race~N~0| 0), Black: 551#true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 416#L64-5true, 163#L89true, Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:26:01,630 INFO L294 olderBase$Statistics]: this new event has 406 ancestors and is cut-off event [2025-03-13 22:26:01,630 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-03-13 22:26:01,630 INFO L297 olderBase$Statistics]: existing Event has 402 ancestors and is cut-off event [2025-03-13 22:26:01,630 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-13 22:26:01,674 INFO L124 PetriNetUnfolderBase]: 294/4122 cut-off events. [2025-03-13 22:26:01,674 INFO L125 PetriNetUnfolderBase]: For 57/66 co-relation queries the response was YES. [2025-03-13 22:26:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 4122 events. 294/4122 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 30538 event pairs, 64 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 4982. Up to 202 conditions per place. [2025-03-13 22:26:01,706 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 36 selfloop transitions, 5 changer transitions 0/451 dead transitions. [2025-03-13 22:26:01,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 451 transitions, 1109 flow [2025-03-13 22:26:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions. [2025-03-13 22:26:01,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916 [2025-03-13 22:26:01,709 INFO L175 Difference]: Start difference. First operand has 454 places, 436 transitions, 989 flow. Second operand 6 states and 2748 transitions. [2025-03-13 22:26:01,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 451 transitions, 1109 flow [2025-03-13 22:26:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 451 transitions, 1061 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-13 22:26:01,715 INFO L231 Difference]: Finished difference. Result has 442 places, 435 transitions, 949 flow [2025-03-13 22:26:01,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=442, PETRI_TRANSITIONS=435} [2025-03-13 22:26:01,716 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -22 predicate places. [2025-03-13 22:26:01,716 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 435 transitions, 949 flow [2025-03-13 22:26:01,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:01,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:01,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:01,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:01,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:26:01,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash -967503480, now seen corresponding path program 1 times [2025-03-13 22:26:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:01,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763890557] [2025-03-13 22:26:01,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:01,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-13 22:26:01,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-13 22:26:01,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:01,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:26:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763890557] [2025-03-13 22:26:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763890557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:01,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521340559] [2025-03-13 22:26:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:01,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:01,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:01,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:02,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500 [2025-03-13 22:26:02,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 435 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:02,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:02,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500 [2025-03-13 22:26:02,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:02,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_6|} AuxVars[] AssignedVars[#race~A~0][218], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 157#L65-31true, 494#(= |#race~N~0| 0), 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 515#(= |#race~A~0| 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:26:02,623 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is cut-off event [2025-03-13 22:26:02,623 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:02,623 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:02,623 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:02,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9) InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} AuxVars[] AssignedVars[~res2~0][435], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 494#(= |#race~N~0| 0), Black: 551#true, 515#(= |#race~A~0| 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 416#L64-5true, 163#L89true, Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:26:02,637 INFO L294 olderBase$Statistics]: this new event has 406 ancestors and is cut-off event [2025-03-13 22:26:02,637 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-03-13 22:26:02,637 INFO L297 olderBase$Statistics]: existing Event has 402 ancestors and is cut-off event [2025-03-13 22:26:02,637 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-13 22:26:02,655 INFO L124 PetriNetUnfolderBase]: 241/3934 cut-off events. [2025-03-13 22:26:02,655 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-13 22:26:02,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 3934 events. 241/3934 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 30458 event pairs, 70 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 4565. Up to 196 conditions per place. [2025-03-13 22:26:02,689 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 36 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-13 22:26:02,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 450 transitions, 1069 flow [2025-03-13 22:26:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions. [2025-03-13 22:26:02,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916 [2025-03-13 22:26:02,693 INFO L175 Difference]: Start difference. First operand has 442 places, 435 transitions, 949 flow. Second operand 6 states and 2748 transitions. [2025-03-13 22:26:02,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 450 transitions, 1069 flow [2025-03-13 22:26:02,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 450 transitions, 1059 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:02,698 INFO L231 Difference]: Finished difference. Result has 441 places, 434 transitions, 947 flow [2025-03-13 22:26:02,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=441, PETRI_TRANSITIONS=434} [2025-03-13 22:26:02,699 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2025-03-13 22:26:02,699 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 947 flow [2025-03-13 22:26:02,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:02,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:02,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:02,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-13 22:26:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -350262492, now seen corresponding path program 1 times [2025-03-13 22:26:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17933557] [2025-03-13 22:26:02,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:02,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-13 22:26:02,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-13 22:26:02,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:02,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:26:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17933557] [2025-03-13 22:26:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17933557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108449734] [2025-03-13 22:26:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:02,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:02,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:02,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:02,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 500 [2025-03-13 22:26:02,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:02,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:02,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 500 [2025-03-13 22:26:02,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:03,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][237], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 157#L65-31true, 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 515#(= |#race~A~0| 0), 585#true, 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)]) [2025-03-13 22:26:03,197 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is cut-off event [2025-03-13 22:26:03,197 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:03,197 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-13 22:26:03,197 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-03-13 22:26:03,251 INFO L124 PetriNetUnfolderBase]: 224/4171 cut-off events. [2025-03-13 22:26:03,252 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-13 22:26:03,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 4171 events. 224/4171 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 31003 event pairs, 74 based on Foata normal form. 0/3894 useless extension candidates. Maximal degree in co-relation 4727. Up to 202 conditions per place. [2025-03-13 22:26:03,285 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 0 selfloop transitions, 0 changer transitions 437/437 dead transitions. [2025-03-13 22:26:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 987 flow [2025-03-13 22:26:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2025-03-13 22:26:03,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9373333333333334 [2025-03-13 22:26:03,288 INFO L175 Difference]: Start difference. First operand has 441 places, 434 transitions, 947 flow. Second operand 3 states and 1406 transitions. [2025-03-13 22:26:03,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 987 flow [2025-03-13 22:26:03,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 437 transitions, 977 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:03,292 INFO L231 Difference]: Finished difference. Result has 437 places, 0 transitions, 0 flow [2025-03-13 22:26:03,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=437, PETRI_TRANSITIONS=0} [2025-03-13 22:26:03,293 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -27 predicate places. [2025-03-13 22:26:03,293 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 0 transitions, 0 flow [2025-03-13 22:26:03,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-03-13 22:26:03,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-03-13 22:26:03,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-03-13 22:26:03,298 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-03-13 22:26:03,299 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-03-13 22:26:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:26:03,299 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] [2025-03-13 22:26:03,305 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:26:03,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:03,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:03 BasicIcfg [2025-03-13 22:26:03,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:03,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:03,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:03,312 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:03,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:47" (3/4) ... [2025-03-13 22:26:03,314 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:26:03,317 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:26:03,317 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:26:03,317 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:26:03,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-13 22:26:03,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:26:03,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:26:03,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:26:03,394 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:03,395 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:03,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:03,395 INFO L158 Benchmark]: Toolchain (without parser) took 16725.30ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 105.7MB in the beginning and 300.8MB in the end (delta: -195.0MB). Peak memory consumption was 677.6MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,395 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.73ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: Boogie Preprocessor took 38.81ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: IcfgBuilder took 640.43ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 50.5MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: TraceAbstraction took 15743.80ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 49.6MB in the beginning and 309.2MB in the end (delta: -259.6MB). Peak memory consumption was 610.5MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,396 INFO L158 Benchmark]: Witness Printer took 82.69ms. Allocated memory is still 1.0GB. Free memory was 309.2MB in the beginning and 300.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:03,397 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.73ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.81ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 640.43ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 50.5MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15743.80ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 49.6MB in the beginning and 309.2MB in the end (delta: -259.6MB). Peak memory consumption was 610.5MB. Max. memory is 16.1GB. * Witness Printer took 82.69ms. Allocated memory is still 1.0GB. Free memory was 309.2MB in the beginning and 300.8MB 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 750 locations, 51 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: 15.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2034 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1148 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3479 IncrementalHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 181 mSDtfsCounter, 3479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=14, InterpolantAutomatonStates: 87, 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, 2.5s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2187 ConstructedInterpolants, 0 QuantifiedInterpolants, 3302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9/9 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:26:03,411 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