./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:46,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:46,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:46,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:46,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:46,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:46,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:46,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:46,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:46,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:46,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:46,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:46,182 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:46,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:46,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:46,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:46,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:46,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:46,184 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-03-14 01:45:46,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:46,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:46,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:46,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:46,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:46,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-03-14 01:45:47,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592359bd1/c3330af7ad6d4f5da98384a514648d75/FLAG654a952ec [2025-03-14 01:45:47,692 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:47,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-03-14 01:45:47,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592359bd1/c3330af7ad6d4f5da98384a514648d75/FLAG654a952ec [2025-03-14 01:45:47,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592359bd1/c3330af7ad6d4f5da98384a514648d75 [2025-03-14 01:45:47,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:47,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:47,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:47,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:47,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:47,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:47,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47, skipping insertion in model container [2025-03-14 01:45:47,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:47,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:47,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:47,920 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:47,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:47,971 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:47,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47 WrapperNode [2025-03-14 01:45:47,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:47,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:47,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:47,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:47,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:47,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,012 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 348 [2025-03-14 01:45:48,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:48,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:48,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:48,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:48,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:48,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:48,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:48,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:48,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (1/1) ... [2025-03-14 01:45:48,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:48,071 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-14 01:45:48,074 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-14 01:45:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:48,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:48,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:48,095 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:48,192 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:48,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:48,650 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:48,651 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:48,651 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:48,852 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:48,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:48 BoogieIcfgContainer [2025-03-14 01:45:48,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:48,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:48,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:48,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:48,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:47" (1/3) ... [2025-03-14 01:45:48,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5382efa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:48, skipping insertion in model container [2025-03-14 01:45:48,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:47" (2/3) ... [2025-03-14 01:45:48,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5382efa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:48, skipping insertion in model container [2025-03-14 01:45:48,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:48" (3/3) ... [2025-03-14 01:45:48,862 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-03-14 01:45:48,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:48,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 351 locations, 1 initial locations, 4 loop locations, and 44 error locations. [2025-03-14 01:45:48,875 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:49,007 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:45:49,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 369 transitions, 759 flow [2025-03-14 01:45:49,156 INFO L124 PetriNetUnfolderBase]: 19/366 cut-off events. [2025-03-14 01:45:49,159 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:49,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 366 events. 19/366 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 886 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2025-03-14 01:45:49,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 360 places, 369 transitions, 759 flow [2025-03-14 01:45:49,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 345 transitions, 708 flow [2025-03-14 01:45:49,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:49,190 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;@3cdd9629, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:49,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2025-03-14 01:45:49,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:49,200 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-14 01:45:49,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:49,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:49,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:49,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -859998810, now seen corresponding path program 1 times [2025-03-14 01:45:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-03-14 01:45:49,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:49,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:45:49,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:45:49,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:49,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434202644] [2025-03-14 01:45:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434202644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:49,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376125937] [2025-03-14 01:45:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:49,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:49,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:49,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-03-14 01:45:49,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 345 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:49,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:49,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-03-14 01:45:49,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:49,572 INFO L124 PetriNetUnfolderBase]: 32/689 cut-off events. [2025-03-14 01:45:49,573 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:45:49,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 689 events. 32/689 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3116 event pairs, 12 based on Foata normal form. 29/610 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-03-14 01:45:49,583 INFO L140 encePairwiseOnDemand]: 345/369 looper letters, 14 selfloop transitions, 2 changer transitions 3/323 dead transitions. [2025-03-14 01:45:49,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 323 transitions, 696 flow [2025-03-14 01:45:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2025-03-14 01:45:49,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232158988256549 [2025-03-14 01:45:49,600 INFO L175 Difference]: Start difference. First operand has 338 places, 345 transitions, 708 flow. Second operand 3 states and 1022 transitions. [2025-03-14 01:45:49,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 323 transitions, 696 flow [2025-03-14 01:45:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 684 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:45:49,611 INFO L231 Difference]: Finished difference. Result has 322 places, 320 transitions, 650 flow [2025-03-14 01:45:49,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=322, PETRI_TRANSITIONS=320} [2025-03-14 01:45:49,617 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -16 predicate places. [2025-03-14 01:45:49,618 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 320 transitions, 650 flow [2025-03-14 01:45:49,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:49,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:49,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:49,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:49,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:49,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash -697830901, now seen corresponding path program 1 times [2025-03-14 01:45:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:49,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118758651] [2025-03-14 01:45:49,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:49,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:45:49,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:45:49,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:49,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:49,677 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-14 01:45:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118758651] [2025-03-14 01:45:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118758651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:49,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417465964] [2025-03-14 01:45:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:49,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:49,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:49,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-03-14 01:45:49,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:49,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:49,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-03-14 01:45:49,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:49,806 INFO L124 PetriNetUnfolderBase]: 23/635 cut-off events. [2025-03-14 01:45:49,806 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:49,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 635 events. 23/635 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2781 event pairs, 8 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 649. Up to 35 conditions per place. [2025-03-14 01:45:49,813 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 14 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-03-14 01:45:49,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 319 transitions, 680 flow [2025-03-14 01:45:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-03-14 01:45:49,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-03-14 01:45:49,819 INFO L175 Difference]: Start difference. First operand has 322 places, 320 transitions, 650 flow. Second operand 3 states and 1001 transitions. [2025-03-14 01:45:49,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 319 transitions, 680 flow [2025-03-14 01:45:49,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:49,825 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 648 flow [2025-03-14 01:45:49,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2025-03-14 01:45:49,827 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2025-03-14 01:45:49,828 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 648 flow [2025-03-14 01:45:49,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:49,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:49,828 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] [2025-03-14 01:45:49,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:49,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:49,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1623419076, now seen corresponding path program 1 times [2025-03-14 01:45:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176600428] [2025-03-14 01:45:49,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:49,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:45:49,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:45:49,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:49,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:49,875 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-14 01:45:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:49,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176600428] [2025-03-14 01:45:49,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176600428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:49,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:49,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:49,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214596877] [2025-03-14 01:45:49,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:49,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:49,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:49,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:49,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:45:49,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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-14 01:45:49,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:49,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:45:49,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:49,990 INFO L124 PetriNetUnfolderBase]: 35/596 cut-off events. [2025-03-14 01:45:49,990 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:45:49,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 596 events. 35/596 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2529 event pairs, 16 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 625. Up to 56 conditions per place. [2025-03-14 01:45:50,005 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 15 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2025-03-14 01:45:50,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 672 flow [2025-03-14 01:45:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-03-14 01:45:50,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-03-14 01:45:50,010 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 648 flow. Second operand 3 states and 998 transitions. [2025-03-14 01:45:50,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 672 flow [2025-03-14 01:45:50,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:50,014 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 638 flow [2025-03-14 01:45:50,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-03-14 01:45:50,016 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -24 predicate places. [2025-03-14 01:45:50,016 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 638 flow [2025-03-14 01:45:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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-14 01:45:50,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:50,017 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] [2025-03-14 01:45:50,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:50,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:50,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash 144809028, now seen corresponding path program 1 times [2025-03-14 01:45:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-03-14 01:45:50,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:50,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:45:50,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:45:50,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:50,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:50,477 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-14 01:45:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-03-14 01:45:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312040161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844225801] [2025-03-14 01:45:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:50,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 369 [2025-03-14 01:45:50,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-14 01:45:50,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:50,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 369 [2025-03-14 01:45:50,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,065 INFO L124 PetriNetUnfolderBase]: 541/3451 cut-off events. [2025-03-14 01:45:51,066 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-14 01:45:51,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 3451 events. 541/3451 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28612 event pairs, 386 based on Foata normal form. 0/2889 useless extension candidates. Maximal degree in co-relation 4297. Up to 786 conditions per place. [2025-03-14 01:45:51,089 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 31 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2025-03-14 01:45:51,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 314 transitions, 708 flow [2025-03-14 01:45:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1891 transitions. [2025-03-14 01:45:51,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541102077687444 [2025-03-14 01:45:51,093 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 638 flow. Second operand 6 states and 1891 transitions. [2025-03-14 01:45:51,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 314 transitions, 708 flow [2025-03-14 01:45:51,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:51,097 INFO L231 Difference]: Finished difference. Result has 317 places, 314 transitions, 645 flow [2025-03-14 01:45:51,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=645, PETRI_PLACES=317, PETRI_TRANSITIONS=314} [2025-03-14 01:45:51,099 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2025-03-14 01:45:51,100 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 314 transitions, 645 flow [2025-03-14 01:45:51,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-14 01:45:51,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,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] [2025-03-14 01:45:51,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:51,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 322265929, now seen corresponding path program 1 times [2025-03-14 01:45:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-03-14 01:45:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-14 01:45:51,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-14 01:45:51,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,127 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-14 01:45:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-03-14 01:45:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135552801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773717899] [2025-03-14 01:45:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 369 [2025-03-14 01:45:51,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 314 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:51,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 369 [2025-03-14 01:45:51,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,262 INFO L124 PetriNetUnfolderBase]: 57/675 cut-off events. [2025-03-14 01:45:51,262 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:45:51,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 675 events. 57/675 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3257 event pairs, 38 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 761. Up to 81 conditions per place. [2025-03-14 01:45:51,267 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 14 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-03-14 01:45:51,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 675 flow [2025-03-14 01:45:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-03-14 01:45:51,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-03-14 01:45:51,269 INFO L175 Difference]: Start difference. First operand has 317 places, 314 transitions, 645 flow. Second operand 3 states and 1001 transitions. [2025-03-14 01:45:51,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 675 flow [2025-03-14 01:45:51,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 665 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:51,273 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 637 flow [2025-03-14 01:45:51,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-03-14 01:45:51,274 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2025-03-14 01:45:51,274 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 637 flow [2025-03-14 01:45:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-14 01:45:51,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,275 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] [2025-03-14 01:45:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:51,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -380714022, now seen corresponding path program 1 times [2025-03-14 01:45:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-03-14 01:45:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:45:51,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:45:51,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,314 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-14 01:45:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-03-14 01:45:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117634663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620845979] [2025-03-14 01:45:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:45:51,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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-14 01:45:51,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:45:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,401 INFO L124 PetriNetUnfolderBase]: 52/649 cut-off events. [2025-03-14 01:45:51,402 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:45:51,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 649 events. 52/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2865 event pairs, 28 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 694. Up to 73 conditions per place. [2025-03-14 01:45:51,409 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2025-03-14 01:45:51,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 309 transitions, 661 flow [2025-03-14 01:45:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 998 transitions. [2025-03-14 01:45:51,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015356820234869 [2025-03-14 01:45:51,411 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 637 flow. Second operand 3 states and 998 transitions. [2025-03-14 01:45:51,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 309 transitions, 661 flow [2025-03-14 01:45:51,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,416 INFO L231 Difference]: Finished difference. Result has 309 places, 309 transitions, 627 flow [2025-03-14 01:45:51,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=309, PETRI_TRANSITIONS=309} [2025-03-14 01:45:51,418 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2025-03-14 01:45:51,418 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 309 transitions, 627 flow [2025-03-14 01:45:51,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 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-14 01:45:51,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,419 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] [2025-03-14 01:45:51,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:51,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:51,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash 96335930, now seen corresponding path program 1 times [2025-03-14 01:45:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-03-14 01:45:51,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-14 01:45:51,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-14 01:45:51,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,472 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-14 01:45:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-03-14 01:45:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214035728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867087677] [2025-03-14 01:45:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 369 [2025-03-14 01:45:51,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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-14 01:45:51,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 369 [2025-03-14 01:45:51,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,576 INFO L124 PetriNetUnfolderBase]: 30/587 cut-off events. [2025-03-14 01:45:51,577 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:45:51,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 587 events. 30/587 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2275 event pairs, 5 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 614. Up to 30 conditions per place. [2025-03-14 01:45:51,580 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2025-03-14 01:45:51,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2025-03-14 01:45:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2025-03-14 01:45:51,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9096657633242999 [2025-03-14 01:45:51,583 INFO L175 Difference]: Start difference. First operand has 309 places, 309 transitions, 627 flow. Second operand 3 states and 1007 transitions. [2025-03-14 01:45:51,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2025-03-14 01:45:51,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:51,588 INFO L231 Difference]: Finished difference. Result has 307 places, 306 transitions, 626 flow [2025-03-14 01:45:51,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=307, PETRI_TRANSITIONS=306} [2025-03-14 01:45:51,590 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -31 predicate places. [2025-03-14 01:45:51,591 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 306 transitions, 626 flow [2025-03-14 01:45:51,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 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-14 01:45:51,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,591 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] [2025-03-14 01:45:51,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:51,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1910421189, now seen corresponding path program 1 times [2025-03-14 01:45:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-14 01:45:51,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:45:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:45:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,638 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-14 01:45:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-14 01:45:51,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208413647] [2025-03-14 01:45:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:45:51,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 306 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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-14 01:45:51,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:45:51,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,873 INFO L124 PetriNetUnfolderBase]: 236/2175 cut-off events. [2025-03-14 01:45:51,873 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-14 01:45:51,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 2175 events. 236/2175 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 15575 event pairs, 61 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 2513. Up to 305 conditions per place. [2025-03-14 01:45:51,884 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 21 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2025-03-14 01:45:51,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 687 flow [2025-03-14 01:45:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-14 01:45:51,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087624209575429 [2025-03-14 01:45:51,887 INFO L175 Difference]: Start difference. First operand has 307 places, 306 transitions, 626 flow. Second operand 3 states and 1006 transitions. [2025-03-14 01:45:51,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 687 flow [2025-03-14 01:45:51,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 310 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,893 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 633 flow [2025-03-14 01:45:51,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2025-03-14 01:45:51,894 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -34 predicate places. [2025-03-14 01:45:51,894 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 633 flow [2025-03-14 01:45:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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-14 01:45:51,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,895 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] [2025-03-14 01:45:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:51,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:51,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -718034643, now seen corresponding path program 1 times [2025-03-14 01:45:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797800194] [2025-03-14 01:45:51,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-14 01:45:51,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-14 01:45:51,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,949 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-14 01:45:51,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797800194] [2025-03-14 01:45:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797800194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117633284] [2025-03-14 01:45:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:45:51,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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-14 01:45:51,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:45:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,068 INFO L124 PetriNetUnfolderBase]: 119/942 cut-off events. [2025-03-14 01:45:52,069 INFO L125 PetriNetUnfolderBase]: For 82/90 co-relation queries the response was YES. [2025-03-14 01:45:52,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 942 events. 119/942 cut-off events. For 82/90 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5200 event pairs, 7 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1170. Up to 116 conditions per place. [2025-03-14 01:45:52,077 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 18 selfloop transitions, 3 changer transitions 0/305 dead transitions. [2025-03-14 01:45:52,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 305 transitions, 682 flow [2025-03-14 01:45:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2025-03-14 01:45:52,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042457091237579 [2025-03-14 01:45:52,080 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 633 flow. Second operand 3 states and 1001 transitions. [2025-03-14 01:45:52,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 305 transitions, 682 flow [2025-03-14 01:45:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 305 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:52,084 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 631 flow [2025-03-14 01:45:52,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-03-14 01:45:52,085 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -36 predicate places. [2025-03-14 01:45:52,085 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 631 flow [2025-03-14 01:45:52,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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-14 01:45:52,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,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] [2025-03-14 01:45:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:52,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:52,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash 610876574, now seen corresponding path program 1 times [2025-03-14 01:45:52,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-03-14 01:45:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:45:52,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:45:52,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,238 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-14 01:45:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828254128] [2025-03-14 01:45:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828254128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:45:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41178267] [2025-03-14 01:45:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:45:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:45:52,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:45:52,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 369 [2025-03-14 01:45:52,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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-14 01:45:52,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 369 [2025-03-14 01:45:52,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,669 INFO L124 PetriNetUnfolderBase]: 115/1253 cut-off events. [2025-03-14 01:45:52,669 INFO L125 PetriNetUnfolderBase]: For 68/108 co-relation queries the response was YES. [2025-03-14 01:45:52,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1253 events. 115/1253 cut-off events. For 68/108 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7420 event pairs, 30 based on Foata normal form. 6/1141 useless extension candidates. Maximal degree in co-relation 1527. Up to 106 conditions per place. [2025-03-14 01:45:52,683 INFO L140 encePairwiseOnDemand]: 356/369 looper letters, 28 selfloop transitions, 14 changer transitions 0/320 dead transitions. [2025-03-14 01:45:52,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 320 transitions, 771 flow [2025-03-14 01:45:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:45:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:45:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions. [2025-03-14 01:45:52,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-14 01:45:52,690 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 631 flow. Second operand 10 states and 3280 transitions. [2025-03-14 01:45:52,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 320 transitions, 771 flow [2025-03-14 01:45:52,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 320 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:52,695 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 691 flow [2025-03-14 01:45:52,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=691, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2025-03-14 01:45:52,697 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -25 predicate places. [2025-03-14 01:45:52,697 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 691 flow [2025-03-14 01:45:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 325.85714285714283) internal successors, (2281), 7 states have internal predecessors, (2281), 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-14 01:45:52,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,699 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] [2025-03-14 01:45:52,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:52,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:52,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 59077265, now seen corresponding path program 1 times [2025-03-14 01:45:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-03-14 01:45:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:45:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:45:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,796 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-14 01:45:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-03-14 01:45:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713083596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968042570] [2025-03-14 01:45:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:45:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:45:52,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:45:52,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 369 [2025-03-14 01:45:52,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 691 flow. Second operand has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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-14 01:45:52,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 369 [2025-03-14 01:45:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,076 INFO L124 PetriNetUnfolderBase]: 222/1940 cut-off events. [2025-03-14 01:45:53,077 INFO L125 PetriNetUnfolderBase]: For 191/200 co-relation queries the response was YES. [2025-03-14 01:45:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1940 events. 222/1940 cut-off events. For 191/200 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13218 event pairs, 75 based on Foata normal form. 12/1775 useless extension candidates. Maximal degree in co-relation 2499. Up to 218 conditions per place. [2025-03-14 01:45:53,085 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 30 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-14 01:45:53,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 323 transitions, 809 flow [2025-03-14 01:45:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:45:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:45:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1663 transitions. [2025-03-14 01:45:53,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013550135501355 [2025-03-14 01:45:53,088 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 691 flow. Second operand 5 states and 1663 transitions. [2025-03-14 01:45:53,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 323 transitions, 809 flow [2025-03-14 01:45:53,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 323 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:53,092 INFO L231 Difference]: Finished difference. Result has 318 places, 310 transitions, 712 flow [2025-03-14 01:45:53,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=318, PETRI_TRANSITIONS=310} [2025-03-14 01:45:53,092 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -20 predicate places. [2025-03-14 01:45:53,093 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 310 transitions, 712 flow [2025-03-14 01:45:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 328.0) internal successors, (1640), 5 states have internal predecessors, (1640), 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-14 01:45:53,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,093 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] [2025-03-14 01:45:53,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:53,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1170700202, now seen corresponding path program 1 times [2025-03-14 01:45:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351131860] [2025-03-14 01:45:53,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-14 01:45:53,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-14 01:45:53,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,343 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-14 01:45:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351131860] [2025-03-14 01:45:53,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351131860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949545132] [2025-03-14 01:45:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:53,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:53,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:53,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 369 [2025-03-14 01:45:53,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 310 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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-14 01:45:53,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 369 [2025-03-14 01:45:53,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L64-->L63-4: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse4 (+ .cse15 v_~A~0.offset_182))) (let ((.cse1 (select (select |v_#memory_int_92| v_~A~0.base_182) .cse4))) (let ((.cse12 (+ .cse1 v_~mts3~0_83))) (let ((.cse0 (<= 0 (+ .cse1 v_~mts3~0_83 2147483648))) (.cse6 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647)) (.cse7 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) (.cse9 (select |v_#race_323| v_~A~0.base_182)) (.cse13 (+ .cse15 v_~A~0.offset_182 1)) (.cse3 (+ .cse15 v_~A~0.offset_182 3)) (.cse2 (select |v_#race_311| v_~A~0.base_182)) (.cse10 (+ .cse15 v_~A~0.offset_182 2)) (.cse5 (<= .cse12 2147483647))) (and (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 .cse3) 0) (= (select .cse2 .cse4) 0) (not (= (ite (or (<= .cse1 0) .cse5) 1 0) 0)) .cse6 .cse0 (= |v_#race~A~0_143| 0) .cse7 (not (= (ite (or .cse6 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_72)) 1 0) 0)) (let ((.cse8 (= |v_#race~A~0_153| 0)) (.cse11 (= |v_#race_323| (store |v_#race_313| v_~A~0.base_182 (store (store (store (store (select |v_#race_313| v_~A~0.base_182) .cse4 0) .cse13 0) .cse10 0) .cse3 0)))) (.cse14 (= |v_#race~mts3~0_130| 0))) (or (and .cse8 (= (+ |v_thread3_#t~mem15#1_96| v_~mts3~0_83) v_~mts3~0_82) (= (select .cse9 .cse10) 0) (= .cse1 |v_thread3_#t~mem15#1_96|) .cse11 (<= 0 .cse12) (= (select .cse9 .cse4) 0) (= (select .cse9 .cse13) 0) .cse14 (= (select .cse9 .cse3) 0)) (and .cse8 (= v_~mts3~0_82 0) (< .cse12 0) .cse11 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_96|) .cse14))) (= (select .cse2 .cse13) 0) (= (+ .cse1 v_~sum~0_72) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= v_~sum~0_72 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) .cse7) 1 0) 0)) (= (store |v_#race_323| v_~A~0.base_182 (store (store (store (store .cse9 .cse4 0) .cse13 0) .cse10 0) .cse3 0)) |v_#race_311|) (= (select .cse2 .cse10) 0) (= v_~sum~0_71 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) .cse5)))))) InVars {~sum~0=v_~sum~0_72, #race=|v_#race_313|, ~A~0.base=v_~A~0.base_182, ~mts3~0=v_~mts3~0_83, ~A~0.offset=v_~A~0.offset_182, #memory_int=|v_#memory_int_92|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{#race=|v_#race_311|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~A~0.base=v_~A~0.base_182, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_71, #race~mts3~0=|v_#race~mts3~0_120|, ~mts3~0=v_~mts3~0_82, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, ~A~0.offset=v_~A~0.offset_182, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #memory_int=|v_#memory_int_92|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_83|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_143|} AuxVars[|v_thread3_#t~mem15#1_96|, |v_#race~mts3~0_130|, |v_#race~A~0_153|, |v_#race_323|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][179], [Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 422#true, 52#L48-34true, 389#(= |#race~A~0| 0), 135#L63-4true, 13#L59true, 93#L86-1true, 371#(= |#race~N~0| 0), 415#true, Black: 406#(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: 400#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(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: 399#(<= ~N~0 0)]) [2025-03-14 01:45:53,822 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-14 01:45:53,822 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:45:53,822 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:45:53,822 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:45:53,861 INFO L124 PetriNetUnfolderBase]: 406/2433 cut-off events. [2025-03-14 01:45:53,862 INFO L125 PetriNetUnfolderBase]: For 450/464 co-relation queries the response was YES. [2025-03-14 01:45:53,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 2433 events. 406/2433 cut-off events. For 450/464 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 18028 event pairs, 71 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 3468. Up to 281 conditions per place. [2025-03-14 01:45:53,878 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 36 selfloop transitions, 5 changer transitions 0/320 dead transitions. [2025-03-14 01:45:53,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 830 flow [2025-03-14 01:45:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2025-03-14 01:45:53,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798554652213189 [2025-03-14 01:45:53,882 INFO L175 Difference]: Start difference. First operand has 318 places, 310 transitions, 712 flow. Second operand 6 states and 1948 transitions. [2025-03-14 01:45:53,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 830 flow [2025-03-14 01:45:53,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,887 INFO L231 Difference]: Finished difference. Result has 319 places, 308 transitions, 713 flow [2025-03-14 01:45:53,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=319, PETRI_TRANSITIONS=308} [2025-03-14 01:45:53,889 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -19 predicate places. [2025-03-14 01:45:53,889 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 308 transitions, 713 flow [2025-03-14 01:45:53,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 319.6666666666667) internal successors, (1918), 6 states have internal predecessors, (1918), 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-14 01:45:53,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:53,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:53,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1793308743, now seen corresponding path program 1 times [2025-03-14 01:45:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-14 01:45:53,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-14 01:45:53,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-14 01:45:53,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,172 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-14 01:45:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621155666] [2025-03-14 01:45:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621155666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-03-14 01:45:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:54,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:54,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 369 [2025-03-14 01:45:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 308 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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-14 01:45:54,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 369 [2025-03-14 01:45:54,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,646 INFO L124 PetriNetUnfolderBase]: 251/1801 cut-off events. [2025-03-14 01:45:54,647 INFO L125 PetriNetUnfolderBase]: For 239/319 co-relation queries the response was YES. [2025-03-14 01:45:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1801 events. 251/1801 cut-off events. For 239/319 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12949 event pairs, 50 based on Foata normal form. 4/1680 useless extension candidates. Maximal degree in co-relation 2617. Up to 221 conditions per place. [2025-03-14 01:45:54,661 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 36 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2025-03-14 01:45:54,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 318 transitions, 831 flow [2025-03-14 01:45:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1948 transitions. [2025-03-14 01:45:54,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798554652213189 [2025-03-14 01:45:54,665 INFO L175 Difference]: Start difference. First operand has 319 places, 308 transitions, 713 flow. Second operand 6 states and 1948 transitions. [2025-03-14 01:45:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 318 transitions, 831 flow [2025-03-14 01:45:54,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 821 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:54,672 INFO L231 Difference]: Finished difference. Result has 317 places, 306 transitions, 709 flow [2025-03-14 01:45:54,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=317, PETRI_TRANSITIONS=306} [2025-03-14 01:45:54,673 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -21 predicate places. [2025-03-14 01:45:54,673 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 306 transitions, 709 flow [2025-03-14 01:45:54,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.1666666666667) internal successors, (1921), 6 states have internal predecessors, (1921), 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-14 01:45:54,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,674 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] [2025-03-14 01:45:54,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:54,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1582992479, now seen corresponding path program 1 times [2025-03-14 01:45:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-14 01:45:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-14 01:45:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-14 01:45:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,706 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-14 01:45:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-03-14 01:45:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326080809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969639114] [2025-03-14 01:45:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:54,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:54,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 369 [2025-03-14 01:45:54,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 306 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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-14 01:45:54,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 369 [2025-03-14 01:45:54,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,855 INFO L124 PetriNetUnfolderBase]: 73/1183 cut-off events. [2025-03-14 01:45:54,855 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2025-03-14 01:45:54,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1183 events. 73/1183 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6841 event pairs, 11 based on Foata normal form. 8/1126 useless extension candidates. Maximal degree in co-relation 1459. Up to 99 conditions per place. [2025-03-14 01:45:54,863 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 9 selfloop transitions, 1 changer transitions 2/304 dead transitions. [2025-03-14 01:45:54,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 304 transitions, 727 flow [2025-03-14 01:45:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2025-03-14 01:45:54,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2025-03-14 01:45:54,866 INFO L175 Difference]: Start difference. First operand has 317 places, 306 transitions, 709 flow. Second operand 3 states and 1011 transitions. [2025-03-14 01:45:54,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 304 transitions, 727 flow [2025-03-14 01:45:54,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:54,872 INFO L231 Difference]: Finished difference. Result has 312 places, 302 transitions, 693 flow [2025-03-14 01:45:54,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=312, PETRI_TRANSITIONS=302} [2025-03-14 01:45:54,873 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -26 predicate places. [2025-03-14 01:45:54,873 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 302 transitions, 693 flow [2025-03-14 01:45:54,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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-14 01:45:54,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,873 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] [2025-03-14 01:45:54,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:54,874 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:54,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2057786419, now seen corresponding path program 1 times [2025-03-14 01:45:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318288370] [2025-03-14 01:45:54,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:45:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:45:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,910 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-14 01:45:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318288370] [2025-03-14 01:45:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318288370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596816077] [2025-03-14 01:45:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:54,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:54,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 369 [2025-03-14 01:45:54,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 302 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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-14 01:45:54,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 369 [2025-03-14 01:45:54,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:55,051 INFO L124 PetriNetUnfolderBase]: 73/1151 cut-off events. [2025-03-14 01:45:55,051 INFO L125 PetriNetUnfolderBase]: For 73/95 co-relation queries the response was YES. [2025-03-14 01:45:55,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1151 events. 73/1151 cut-off events. For 73/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6565 event pairs, 11 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 1405. Up to 99 conditions per place. [2025-03-14 01:45:55,059 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 6 selfloop transitions, 0 changer transitions 14/300 dead transitions. [2025-03-14 01:45:55,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 300 transitions, 711 flow [2025-03-14 01:45:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2025-03-14 01:45:55,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2025-03-14 01:45:55,062 INFO L175 Difference]: Start difference. First operand has 312 places, 302 transitions, 693 flow. Second operand 3 states and 1011 transitions. [2025-03-14 01:45:55,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 300 transitions, 711 flow [2025-03-14 01:45:55,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 300 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:55,067 INFO L231 Difference]: Finished difference. Result has 309 places, 286 transitions, 657 flow [2025-03-14 01:45:55,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=309, PETRI_TRANSITIONS=286} [2025-03-14 01:45:55,068 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -29 predicate places. [2025-03-14 01:45:55,068 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 286 transitions, 657 flow [2025-03-14 01:45:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 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-14 01:45:55,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:55,069 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] [2025-03-14 01:45:55,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:55,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1700552181, now seen corresponding path program 1 times [2025-03-14 01:45:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738902875] [2025-03-14 01:45:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:55,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-14 01:45:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-14 01:45:55,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:55,109 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-14 01:45:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738902875] [2025-03-14 01:45:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738902875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147641364] [2025-03-14 01:45:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:55,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:55,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:55,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 369 [2025-03-14 01:45:55,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-14 01:45:55,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:55,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 369 [2025-03-14 01:45:55,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:55,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] L64-->L63-4: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse4 (+ .cse15 v_~A~0.offset_182))) (let ((.cse1 (select (select |v_#memory_int_92| v_~A~0.base_182) .cse4))) (let ((.cse12 (+ .cse1 v_~mts3~0_83))) (let ((.cse0 (<= 0 (+ .cse1 v_~mts3~0_83 2147483648))) (.cse6 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647)) (.cse7 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) (.cse9 (select |v_#race_323| v_~A~0.base_182)) (.cse13 (+ .cse15 v_~A~0.offset_182 1)) (.cse3 (+ .cse15 v_~A~0.offset_182 3)) (.cse2 (select |v_#race_311| v_~A~0.base_182)) (.cse10 (+ .cse15 v_~A~0.offset_182 2)) (.cse5 (<= .cse12 2147483647))) (and (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 .cse3) 0) (= (select .cse2 .cse4) 0) (not (= (ite (or (<= .cse1 0) .cse5) 1 0) 0)) .cse6 .cse0 (= |v_#race~A~0_143| 0) .cse7 (not (= (ite (or .cse6 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_72)) 1 0) 0)) (let ((.cse8 (= |v_#race~A~0_153| 0)) (.cse11 (= |v_#race_323| (store |v_#race_313| v_~A~0.base_182 (store (store (store (store (select |v_#race_313| v_~A~0.base_182) .cse4 0) .cse13 0) .cse10 0) .cse3 0)))) (.cse14 (= |v_#race~mts3~0_130| 0))) (or (and .cse8 (= (+ |v_thread3_#t~mem15#1_96| v_~mts3~0_83) v_~mts3~0_82) (= (select .cse9 .cse10) 0) (= .cse1 |v_thread3_#t~mem15#1_96|) .cse11 (<= 0 .cse12) (= (select .cse9 .cse4) 0) (= (select .cse9 .cse13) 0) .cse14 (= (select .cse9 .cse3) 0)) (and .cse8 (= v_~mts3~0_82 0) (< .cse12 0) .cse11 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_96|) .cse14))) (= (select .cse2 .cse13) 0) (= (+ .cse1 v_~sum~0_72) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= v_~sum~0_72 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) .cse7) 1 0) 0)) (= (store |v_#race_323| v_~A~0.base_182 (store (store (store (store .cse9 .cse4 0) .cse13 0) .cse10 0) .cse3 0)) |v_#race_311|) (= (select .cse2 .cse10) 0) (= v_~sum~0_71 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) .cse5)))))) InVars {~sum~0=v_~sum~0_72, #race=|v_#race_313|, ~A~0.base=v_~A~0.base_182, ~mts3~0=v_~mts3~0_83, ~A~0.offset=v_~A~0.offset_182, #memory_int=|v_#memory_int_92|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{#race=|v_#race_311|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, ~A~0.base=v_~A~0.base_182, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_71, #race~mts3~0=|v_#race~mts3~0_120|, ~mts3~0=v_~mts3~0_82, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, ~A~0.offset=v_~A~0.offset_182, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #memory_int=|v_#memory_int_92|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, #race~sum~0=|v_#race~sum~0_83|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_143|} AuxVars[|v_thread3_#t~mem15#1_96|, |v_#race~mts3~0_130|, |v_#race~A~0_153|, |v_#race_323|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][176], [437#true, Black: 418#(<= (+ ~M~0 1) 0), Black: 419#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 387#true, 383#(= |#race~M~0| 0), 52#L48-34true, 440#true, 389#(= |#race~A~0| 0), 135#L63-4true, 93#L86-1true, 371#(= |#race~N~0| 0), 129#L56-35true, Black: 406#(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: 400#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 404#(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: 399#(<= ~N~0 0)]) [2025-03-14 01:45:55,273 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-14 01:45:55,273 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:45:55,273 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:45:55,273 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:45:55,313 INFO L124 PetriNetUnfolderBase]: 205/1866 cut-off events. [2025-03-14 01:45:55,313 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2025-03-14 01:45:55,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1866 events. 205/1866 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12087 event pairs, 54 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 2405. Up to 200 conditions per place. [2025-03-14 01:45:55,327 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 12 selfloop transitions, 2 changer transitions 7/288 dead transitions. [2025-03-14 01:45:55,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 695 flow [2025-03-14 01:45:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-03-14 01:45:55,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907859078590786 [2025-03-14 01:45:55,330 INFO L175 Difference]: Start difference. First operand has 309 places, 286 transitions, 657 flow. Second operand 3 states and 1005 transitions. [2025-03-14 01:45:55,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 695 flow [2025-03-14 01:45:55,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 695 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:55,334 INFO L231 Difference]: Finished difference. Result has 294 places, 279 transitions, 627 flow [2025-03-14 01:45:55,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=294, PETRI_TRANSITIONS=279} [2025-03-14 01:45:55,335 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -44 predicate places. [2025-03-14 01:45:55,335 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 279 transitions, 627 flow [2025-03-14 01:45:55,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-14 01:45:55,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:55,335 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] [2025-03-14 01:45:55,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:55,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2025-03-14 01:45:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1886178578, now seen corresponding path program 1 times [2025-03-14 01:45:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427332577] [2025-03-14 01:45:55,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-14 01:45:55,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-14 01:45:55,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:55,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:55,384 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-14 01:45:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427332577] [2025-03-14 01:45:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427332577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:55,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033140337] [2025-03-14 01:45:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:55,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:55,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:55,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 369 [2025-03-14 01:45:55,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 279 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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-14 01:45:55,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:55,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 369 [2025-03-14 01:45:55,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:55,552 INFO L124 PetriNetUnfolderBase]: 125/1615 cut-off events. [2025-03-14 01:45:55,552 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-14 01:45:55,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1615 events. 125/1615 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9786 event pairs, 37 based on Foata normal form. 0/1522 useless extension candidates. Maximal degree in co-relation 2004. Up to 131 conditions per place. [2025-03-14 01:45:55,561 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-03-14 01:45:55,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 665 flow [2025-03-14 01:45:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2025-03-14 01:45:55,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105691056910569 [2025-03-14 01:45:55,563 INFO L175 Difference]: Start difference. First operand has 294 places, 279 transitions, 627 flow. Second operand 3 states and 1008 transitions. [2025-03-14 01:45:55,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 665 flow [2025-03-14 01:45:55,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 641 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-14 01:45:55,566 INFO L231 Difference]: Finished difference. Result has 283 places, 0 transitions, 0 flow [2025-03-14 01:45:55,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=283, PETRI_TRANSITIONS=0} [2025-03-14 01:45:55,567 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -55 predicate places. [2025-03-14 01:45:55,567 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 0 transitions, 0 flow [2025-03-14 01:45:55,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.6666666666667) internal successors, (998), 3 states have internal predecessors, (998), 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-14 01:45:55,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2025-03-14 01:45:55,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2025-03-14 01:45:55,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2025-03-14 01:45:55,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2025-03-14 01:45:55,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2025-03-14 01:45:55,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2025-03-14 01:45:55,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2025-03-14 01:45:55,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2025-03-14 01:45:55,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2025-03-14 01:45:55,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:55,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:55,580 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:45:55,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:45:55,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:45:55 BasicIcfg [2025-03-14 01:45:55,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:45:55,586 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:45:55,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:45:55,586 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:45:55,587 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:48" (3/4) ... [2025-03-14 01:45:55,589 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:45:55,591 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:45:55,591 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:45:55,591 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:45:55,595 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-14 01:45:55,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:45:55,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:45:55,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:45:55,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:45:55,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:45:55,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:45:55,663 INFO L158 Benchmark]: Toolchain (without parser) took 7924.14ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 160.1MB in the beginning and 340.5MB in the end (delta: -180.3MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2025-03-14 01:45:55,664 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:55,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.43ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 147.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:55,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.82ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 144.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:55,665 INFO L158 Benchmark]: Boogie Preprocessor took 28.28ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 141.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:55,665 INFO L158 Benchmark]: IcfgBuilder took 813.07ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 71.2MB in the end (delta: 70.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-14 01:45:55,665 INFO L158 Benchmark]: TraceAbstraction took 6729.36ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 70.7MB in the beginning and 344.7MB in the end (delta: -274.0MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:55,665 INFO L158 Benchmark]: Witness Printer took 75.77ms. Allocated memory is still 520.1MB. Free memory was 344.7MB in the beginning and 340.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:55,666 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.20ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.43ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 147.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.82ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 144.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.28ms. Allocated memory is still 201.3MB. Free memory was 144.1MB in the beginning and 141.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 813.07ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 71.2MB in the end (delta: 70.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6729.36ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 70.7MB in the beginning and 344.7MB in the end (delta: -274.0MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Witness Printer took 75.77ms. Allocated memory is still 520.1MB. Free memory was 344.7MB in the beginning and 340.5MB in the end (delta: 4.2MB). There was no memory consumed. 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: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 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 - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 534 locations, 76 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: 6.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1563 IncrementalHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 195 mSDtfsCounter, 1563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=12, InterpolantAutomatonStates: 69, 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 5/5 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:45:55,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE