./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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-buffer-mult2.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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:07:26,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:26,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:26,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:26,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:26,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:26,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:26,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:26,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:26,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:26,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:26,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:26,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:26,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:26,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:26,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:26,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:26,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:26,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:26,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:26,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:26,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:26,248 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-03-08 22:07:26,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:26,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:26,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:26,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:26,503 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:26,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-08 22:07:27,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10791942/83e00374f9a340cb920554b5a19b57a0/FLAG0af9c9147 [2025-03-08 22:07:27,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:27,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-08 22:07:27,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10791942/83e00374f9a340cb920554b5a19b57a0/FLAG0af9c9147 [2025-03-08 22:07:28,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10791942/83e00374f9a340cb920554b5a19b57a0 [2025-03-08 22:07:28,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:28,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:28,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:28,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:28,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:28,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254335bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28, skipping insertion in model container [2025-03-08 22:07:28,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:28,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:28,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:28,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:28,462 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:28,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28 WrapperNode [2025-03-08 22:07:28,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:28,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:28,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:28,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:28,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,503 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 556 [2025-03-08 22:07:28,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:28,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:28,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:28,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:28,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,536 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:28,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:28,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:28,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:28,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (1/1) ... [2025-03-08 22:07:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:28,577 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-08 22:07:28,582 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-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-08 22:07:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:28,600 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:07:28,696 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:28,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:29,349 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:29,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:29,702 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:29,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:29,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:29 BoogieIcfgContainer [2025-03-08 22:07:29,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:29,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:29,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:29,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:28" (1/3) ... [2025-03-08 22:07:29,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e80e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:29, skipping insertion in model container [2025-03-08 22:07:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:28" (2/3) ... [2025-03-08 22:07:29,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e80e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:29, skipping insertion in model container [2025-03-08 22:07:29,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:29" (3/3) ... [2025-03-08 22:07:29,714 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-03-08 22:07:29,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:29,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 369 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-03-08 22:07:29,729 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:29,831 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 22:07:29,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 381 transitions, 790 flow [2025-03-08 22:07:30,004 INFO L124 PetriNetUnfolderBase]: 13/377 cut-off events. [2025-03-08 22:07:30,006 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:30,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 377 events. 13/377 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 588 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 329. Up to 2 conditions per place. [2025-03-08 22:07:30,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 381 places, 381 transitions, 790 flow [2025-03-08 22:07:30,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 360 transitions, 744 flow [2025-03-08 22:07:30,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:30,041 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;@740c80f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:30,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2025-03-08 22:07:30,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:30,047 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-08 22:07:30,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:30,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:30,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:30,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:30,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 880683604, now seen corresponding path program 1 times [2025-03-08 22:07:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38862206] [2025-03-08 22:07:30,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:30,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:07:30,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:07:30,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:30,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:30,187 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-08 22:07:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38862206] [2025-03-08 22:07:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38862206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096448559] [2025-03-08 22:07:30,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:30,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:30,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:30,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:30,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 360 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:30,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:30,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:30,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:30,569 INFO L124 PetriNetUnfolderBase]: 451/1148 cut-off events. [2025-03-08 22:07:30,569 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-08 22:07:30,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1148 events. 451/1148 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5118 event pairs, 272 based on Foata normal form. 5/1030 useless extension candidates. Maximal degree in co-relation 1525. Up to 613 conditions per place. [2025-03-08 22:07:30,581 INFO L140 encePairwiseOnDemand]: 303/381 looper letters, 24 selfloop transitions, 2 changer transitions 5/284 dead transitions. [2025-03-08 22:07:30,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 284 transitions, 644 flow [2025-03-08 22:07:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-08 22:07:30,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8136482939632546 [2025-03-08 22:07:30,602 INFO L175 Difference]: Start difference. First operand has 361 places, 360 transitions, 744 flow. Second operand 3 states and 930 transitions. [2025-03-08 22:07:30,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 284 transitions, 644 flow [2025-03-08 22:07:30,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 284 transitions, 628 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-08 22:07:30,613 INFO L231 Difference]: Finished difference. Result has 284 places, 279 transitions, 570 flow [2025-03-08 22:07:30,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=284, PETRI_TRANSITIONS=279} [2025-03-08 22:07:30,619 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -77 predicate places. [2025-03-08 22:07:30,620 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 279 transitions, 570 flow [2025-03-08 22:07:30,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:30,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:30,621 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] [2025-03-08 22:07:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:07:30,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:30,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -292085796, now seen corresponding path program 1 times [2025-03-08 22:07:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534318234] [2025-03-08 22:07:30,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:30,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:07:30,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:07:30,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:30,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:30,688 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-08 22:07:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534318234] [2025-03-08 22:07:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534318234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440795274] [2025-03-08 22:07:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:30,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:30,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:30,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:30,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 279 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:30,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:30,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:30,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:30,960 INFO L124 PetriNetUnfolderBase]: 451/1142 cut-off events. [2025-03-08 22:07:30,960 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 22:07:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1142 events. 451/1142 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5124 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1762. Up to 613 conditions per place. [2025-03-08 22:07:30,968 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-08 22:07:30,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 620 flow [2025-03-08 22:07:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-08 22:07:30,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-08 22:07:30,971 INFO L175 Difference]: Start difference. First operand has 284 places, 279 transitions, 570 flow. Second operand 3 states and 855 transitions. [2025-03-08 22:07:30,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 278 transitions, 620 flow [2025-03-08 22:07:30,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 278 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:30,976 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 568 flow [2025-03-08 22:07:30,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-03-08 22:07:30,978 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -83 predicate places. [2025-03-08 22:07:30,978 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 568 flow [2025-03-08 22:07:30,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:30,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:30,979 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] [2025-03-08 22:07:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:07:30,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1926733303, now seen corresponding path program 1 times [2025-03-08 22:07:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683959136] [2025-03-08 22:07:30,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:30,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:07:30,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:07:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:31,044 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-08 22:07:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683959136] [2025-03-08 22:07:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683959136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961310928] [2025-03-08 22:07:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:31,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:31,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:31,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:31,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:31,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:31,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:31,256 INFO L124 PetriNetUnfolderBase]: 451/1141 cut-off events. [2025-03-08 22:07:31,256 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 22:07:31,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 1141 events. 451/1141 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5099 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1753. Up to 613 conditions per place. [2025-03-08 22:07:31,262 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-08 22:07:31,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 618 flow [2025-03-08 22:07:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-08 22:07:31,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-08 22:07:31,266 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 568 flow. Second operand 3 states and 855 transitions. [2025-03-08 22:07:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 618 flow [2025-03-08 22:07:31,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:31,270 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 566 flow [2025-03-08 22:07:31,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2025-03-08 22:07:31,271 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -84 predicate places. [2025-03-08 22:07:31,271 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 566 flow [2025-03-08 22:07:31,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:31,272 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] [2025-03-08 22:07:31,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:07:31,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1487725916, now seen corresponding path program 1 times [2025-03-08 22:07:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707661484] [2025-03-08 22:07:31,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:31,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:07:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:07:31,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:31,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:31,311 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-08 22:07:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707661484] [2025-03-08 22:07:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707661484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380639487] [2025-03-08 22:07:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:31,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:31,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:31,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:31,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:31,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:31,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:31,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:31,487 INFO L124 PetriNetUnfolderBase]: 451/1140 cut-off events. [2025-03-08 22:07:31,487 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 22:07:31,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1140 events. 451/1140 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5093 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1744. Up to 613 conditions per place. [2025-03-08 22:07:31,493 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-03-08 22:07:31,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 276 transitions, 616 flow [2025-03-08 22:07:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-08 22:07:31,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-08 22:07:31,496 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 566 flow. Second operand 3 states and 855 transitions. [2025-03-08 22:07:31,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 276 transitions, 616 flow [2025-03-08 22:07:31,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 276 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:31,499 INFO L231 Difference]: Finished difference. Result has 276 places, 276 transitions, 564 flow [2025-03-08 22:07:31,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=276} [2025-03-08 22:07:31,501 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -85 predicate places. [2025-03-08 22:07:31,501 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 276 transitions, 564 flow [2025-03-08 22:07:31,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:31,502 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] [2025-03-08 22:07:31,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:07:31,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:31,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 790138972, now seen corresponding path program 1 times [2025-03-08 22:07:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:31,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201467502] [2025-03-08 22:07:31,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:31,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:07:31,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:07:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:31,556 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-08 22:07:31,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:31,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201467502] [2025-03-08 22:07:31,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201467502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924014484] [2025-03-08 22:07:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:31,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:31,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:31,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:31,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:31,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:31,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:31,720 INFO L124 PetriNetUnfolderBase]: 451/1139 cut-off events. [2025-03-08 22:07:31,720 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-08 22:07:31,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1139 events. 451/1139 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5070 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1735. Up to 613 conditions per place. [2025-03-08 22:07:31,728 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-03-08 22:07:31,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 614 flow [2025-03-08 22:07:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-08 22:07:31,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-08 22:07:31,734 INFO L175 Difference]: Start difference. First operand has 276 places, 276 transitions, 564 flow. Second operand 3 states and 855 transitions. [2025-03-08 22:07:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 614 flow [2025-03-08 22:07:31,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:31,737 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 562 flow [2025-03-08 22:07:31,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-03-08 22:07:31,738 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-08 22:07:31,739 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 562 flow [2025-03-08 22:07:31,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:31,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:31,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:07:31,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:07:31,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:31,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash -666719695, now seen corresponding path program 1 times [2025-03-08 22:07:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:31,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955464549] [2025-03-08 22:07:31,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:07:31,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:07:31,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:31,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:31,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-08 22:07:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955464549] [2025-03-08 22:07:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955464549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:31,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694978988] [2025-03-08 22:07:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:31,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:31,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:31,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:31,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:31,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:31,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:31,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:31,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:32,000 INFO L124 PetriNetUnfolderBase]: 595/1525 cut-off events. [2025-03-08 22:07:32,000 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 22:07:32,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 1525 events. 595/1525 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8189 event pairs, 228 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2315. Up to 435 conditions per place. [2025-03-08 22:07:32,011 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 36 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-03-08 22:07:32,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 671 flow [2025-03-08 22:07:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-03-08 22:07:32,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7690288713910761 [2025-03-08 22:07:32,017 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 562 flow. Second operand 3 states and 879 transitions. [2025-03-08 22:07:32,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 671 flow [2025-03-08 22:07:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:32,021 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 566 flow [2025-03-08 22:07:32,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-03-08 22:07:32,023 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-08 22:07:32,024 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 566 flow [2025-03-08 22:07:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:32,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:32,024 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] [2025-03-08 22:07:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:07:32,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:32,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1213732785, now seen corresponding path program 1 times [2025-03-08 22:07:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735348641] [2025-03-08 22:07:32,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:07:32,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:07:32,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:32,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:32,076 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-08 22:07:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735348641] [2025-03-08 22:07:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735348641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749350922] [2025-03-08 22:07:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:32,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:32,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:32,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:32,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-08 22:07:32,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:32,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-08 22:07:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:32,285 INFO L124 PetriNetUnfolderBase]: 595/1527 cut-off events. [2025-03-08 22:07:32,286 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-08 22:07:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 1527 events. 595/1527 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8315 event pairs, 375 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 1224. Up to 808 conditions per place. [2025-03-08 22:07:32,294 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-03-08 22:07:32,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 274 transitions, 616 flow [2025-03-08 22:07:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-08 22:07:32,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-08 22:07:32,296 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 566 flow. Second operand 3 states and 857 transitions. [2025-03-08 22:07:32,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 274 transitions, 616 flow [2025-03-08 22:07:32,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 274 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:32,300 INFO L231 Difference]: Finished difference. Result has 275 places, 274 transitions, 566 flow [2025-03-08 22:07:32,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2025-03-08 22:07:32,301 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-08 22:07:32,301 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 566 flow [2025-03-08 22:07:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:32,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:32,301 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] [2025-03-08 22:07:32,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:07:32,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1405578194, now seen corresponding path program 1 times [2025-03-08 22:07:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445253540] [2025-03-08 22:07:32,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:32,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 22:07:32,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 22:07:32,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:32,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:32,336 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-08 22:07:32,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445253540] [2025-03-08 22:07:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445253540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287258745] [2025-03-08 22:07:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:32,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:32,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:32,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-08 22:07:32,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:32,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:32,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-08 22:07:32,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:32,543 INFO L124 PetriNetUnfolderBase]: 595/1526 cut-off events. [2025-03-08 22:07:32,544 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-03-08 22:07:32,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 1526 events. 595/1526 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8329 event pairs, 375 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2408. Up to 809 conditions per place. [2025-03-08 22:07:32,552 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-03-08 22:07:32,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 273 transitions, 618 flow [2025-03-08 22:07:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-08 22:07:32,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-08 22:07:32,555 INFO L175 Difference]: Start difference. First operand has 275 places, 274 transitions, 566 flow. Second operand 3 states and 855 transitions. [2025-03-08 22:07:32,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 273 transitions, 618 flow [2025-03-08 22:07:32,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:32,560 INFO L231 Difference]: Finished difference. Result has 274 places, 273 transitions, 564 flow [2025-03-08 22:07:32,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2025-03-08 22:07:32,561 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-08 22:07:32,562 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 564 flow [2025-03-08 22:07:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-08 22:07:32,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:32,563 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] [2025-03-08 22:07:32,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:07:32,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 172503133, now seen corresponding path program 1 times [2025-03-08 22:07:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474998262] [2025-03-08 22:07:32,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:32,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:07:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:07:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:32,595 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-08 22:07:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474998262] [2025-03-08 22:07:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474998262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:32,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122552009] [2025-03-08 22:07:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:32,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:32,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:32,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:32,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:32,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:32,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:32,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:32,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:32,816 INFO L124 PetriNetUnfolderBase]: 749/1831 cut-off events. [2025-03-08 22:07:32,817 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-03-08 22:07:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 1831 events. 749/1831 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10375 event pairs, 262 based on Foata normal form. 0/1652 useless extension candidates. Maximal degree in co-relation 2938. Up to 544 conditions per place. [2025-03-08 22:07:32,827 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 37 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-08 22:07:32,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 287 transitions, 678 flow [2025-03-08 22:07:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-03-08 22:07:32,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7681539807524059 [2025-03-08 22:07:32,830 INFO L175 Difference]: Start difference. First operand has 274 places, 273 transitions, 564 flow. Second operand 3 states and 878 transitions. [2025-03-08 22:07:32,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 287 transitions, 678 flow [2025-03-08 22:07:32,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 287 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:32,835 INFO L231 Difference]: Finished difference. Result has 274 places, 273 transitions, 568 flow [2025-03-08 22:07:32,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2025-03-08 22:07:32,836 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-08 22:07:32,836 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 568 flow [2025-03-08 22:07:32,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:32,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:32,838 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] [2025-03-08 22:07:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:07:32,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1383292697, now seen corresponding path program 1 times [2025-03-08 22:07:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968425349] [2025-03-08 22:07:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:32,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 22:07:32,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:07:32,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:32,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:32,892 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-08 22:07:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968425349] [2025-03-08 22:07:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968425349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245147466] [2025-03-08 22:07:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:32,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:32,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:32,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:32,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-08 22:07:32,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:32,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:32,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-08 22:07:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:33,112 INFO L124 PetriNetUnfolderBase]: 749/1954 cut-off events. [2025-03-08 22:07:33,112 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-03-08 22:07:33,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1954 events. 749/1954 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12046 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 1748. Up to 1018 conditions per place. [2025-03-08 22:07:33,122 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-03-08 22:07:33,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 272 transitions, 620 flow [2025-03-08 22:07:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-08 22:07:33,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-08 22:07:33,125 INFO L175 Difference]: Start difference. First operand has 274 places, 273 transitions, 568 flow. Second operand 3 states and 857 transitions. [2025-03-08 22:07:33,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 272 transitions, 620 flow [2025-03-08 22:07:33,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:33,149 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 568 flow [2025-03-08 22:07:33,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2025-03-08 22:07:33,150 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-08 22:07:33,150 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 568 flow [2025-03-08 22:07:33,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:33,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:33,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:33,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:07:33,151 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -536970527, now seen corresponding path program 1 times [2025-03-08 22:07:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896438486] [2025-03-08 22:07:33,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 22:07:33,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 22:07:33,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:33,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:33,185 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-08 22:07:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896438486] [2025-03-08 22:07:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896438486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761513180] [2025-03-08 22:07:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:33,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:33,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:33,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:33,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:33,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:33,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:33,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:33,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:33,443 INFO L124 PetriNetUnfolderBase]: 749/1953 cut-off events. [2025-03-08 22:07:33,444 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 1953 events. 749/1953 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12051 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3161. Up to 1016 conditions per place. [2025-03-08 22:07:33,454 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/271 dead transitions. [2025-03-08 22:07:33,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 616 flow [2025-03-08 22:07:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-08 22:07:33,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-08 22:07:33,457 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 568 flow. Second operand 3 states and 864 transitions. [2025-03-08 22:07:33,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 616 flow [2025-03-08 22:07:33,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 271 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:33,487 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 564 flow [2025-03-08 22:07:33,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2025-03-08 22:07:33,488 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -88 predicate places. [2025-03-08 22:07:33,488 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 564 flow [2025-03-08 22:07:33,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:33,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:33,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:07:33,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:33,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1435741756, now seen corresponding path program 1 times [2025-03-08 22:07:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549222643] [2025-03-08 22:07:33,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 22:07:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 22:07:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:33,545 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-08 22:07:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549222643] [2025-03-08 22:07:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549222643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598119154] [2025-03-08 22:07:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:33,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:33,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:33,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:33,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-08 22:07:33,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:33,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:33,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-08 22:07:33,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:33,777 INFO L124 PetriNetUnfolderBase]: 749/1952 cut-off events. [2025-03-08 22:07:33,778 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:33,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 1952 events. 749/1952 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12052 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3161. Up to 1018 conditions per place. [2025-03-08 22:07:33,784 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-03-08 22:07:33,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 270 transitions, 616 flow [2025-03-08 22:07:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-08 22:07:33,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-08 22:07:33,787 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 564 flow. Second operand 3 states and 857 transitions. [2025-03-08 22:07:33,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 270 transitions, 616 flow [2025-03-08 22:07:33,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 270 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:33,790 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 565 flow [2025-03-08 22:07:33,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-03-08 22:07:33,791 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -88 predicate places. [2025-03-08 22:07:33,791 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 565 flow [2025-03-08 22:07:33,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:33,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:33,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:07:33,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1105862111, now seen corresponding path program 1 times [2025-03-08 22:07:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145465539] [2025-03-08 22:07:33,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:33,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 22:07:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 22:07:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:34,256 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-08 22:07:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145465539] [2025-03-08 22:07:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145465539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862523311] [2025-03-08 22:07:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:34,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 381 [2025-03-08 22:07:34,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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-08 22:07:34,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:34,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 381 [2025-03-08 22:07:34,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:34,577 INFO L124 PetriNetUnfolderBase]: 749/1950 cut-off events. [2025-03-08 22:07:34,577 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:34,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1950 events. 749/1950 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12030 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3183. Up to 1031 conditions per place. [2025-03-08 22:07:34,587 INFO L140 encePairwiseOnDemand]: 369/381 looper letters, 38 selfloop transitions, 10 changer transitions 0/268 dead transitions. [2025-03-08 22:07:34,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 657 flow [2025-03-08 22:07:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1584 transitions. [2025-03-08 22:07:34,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929133858267716 [2025-03-08 22:07:34,590 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 565 flow. Second operand 6 states and 1584 transitions. [2025-03-08 22:07:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 657 flow [2025-03-08 22:07:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:34,594 INFO L231 Difference]: Finished difference. Result has 274 places, 268 transitions, 577 flow [2025-03-08 22:07:34,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2025-03-08 22:07:34,595 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-08 22:07:34,595 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 577 flow [2025-03-08 22:07:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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-08 22:07:34,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:34,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:34,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:07:34,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -306595068, now seen corresponding path program 1 times [2025-03-08 22:07:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:34,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364029767] [2025-03-08 22:07:34,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:34,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:07:34,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:07:34,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:34,630 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-08 22:07:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364029767] [2025-03-08 22:07:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364029767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461124050] [2025-03-08 22:07:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:34,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:34,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:34,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:34,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:34,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:34,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:34,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:34,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:34,917 INFO L124 PetriNetUnfolderBase]: 749/1949 cut-off events. [2025-03-08 22:07:34,917 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:34,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1949 events. 749/1949 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12039 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3228. Up to 1016 conditions per place. [2025-03-08 22:07:34,934 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-03-08 22:07:34,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 267 transitions, 625 flow [2025-03-08 22:07:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-08 22:07:34,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-08 22:07:34,936 INFO L175 Difference]: Start difference. First operand has 274 places, 268 transitions, 577 flow. Second operand 3 states and 864 transitions. [2025-03-08 22:07:34,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 267 transitions, 625 flow [2025-03-08 22:07:34,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 605 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:34,941 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 557 flow [2025-03-08 22:07:34,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2025-03-08 22:07:34,943 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-08 22:07:34,943 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 557 flow [2025-03-08 22:07:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:34,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:34,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:34,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:07:34,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:34,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1518379416, now seen corresponding path program 1 times [2025-03-08 22:07:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078452864] [2025-03-08 22:07:34,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:34,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:34,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:07:34,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:07:34,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:34,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:34,996 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-08 22:07:34,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078452864] [2025-03-08 22:07:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078452864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313068067] [2025-03-08 22:07:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:34,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:34,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:34,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:35,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-08 22:07:35,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:35,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:35,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-08 22:07:35,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:35,283 INFO L124 PetriNetUnfolderBase]: 749/1948 cut-off events. [2025-03-08 22:07:35,283 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:35,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1948 events. 749/1948 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12010 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3158. Up to 1018 conditions per place. [2025-03-08 22:07:35,290 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-03-08 22:07:35,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 609 flow [2025-03-08 22:07:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-08 22:07:35,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-08 22:07:35,292 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 557 flow. Second operand 3 states and 857 transitions. [2025-03-08 22:07:35,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 609 flow [2025-03-08 22:07:35,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 266 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:35,296 INFO L231 Difference]: Finished difference. Result has 270 places, 266 transitions, 558 flow [2025-03-08 22:07:35,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=270, PETRI_TRANSITIONS=266} [2025-03-08 22:07:35,298 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-08 22:07:35,298 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 266 transitions, 558 flow [2025-03-08 22:07:35,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 22:07:35,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:35,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:35,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:07:35,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:35,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 37236742, now seen corresponding path program 1 times [2025-03-08 22:07:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678890512] [2025-03-08 22:07:35,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:35,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 22:07:35,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 22:07:35,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:35,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:35,342 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-08 22:07:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:35,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678890512] [2025-03-08 22:07:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678890512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:35,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:35,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405973655] [2025-03-08 22:07:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:35,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:35,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:35,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:35,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:35,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 266 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:35,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:35,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:35,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:35,546 INFO L124 PetriNetUnfolderBase]: 749/1947 cut-off events. [2025-03-08 22:07:35,546 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-08 22:07:35,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1947 events. 749/1947 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12018 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3157. Up to 1016 conditions per place. [2025-03-08 22:07:35,556 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2025-03-08 22:07:35,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 265 transitions, 606 flow [2025-03-08 22:07:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-08 22:07:35,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-08 22:07:35,559 INFO L175 Difference]: Start difference. First operand has 270 places, 266 transitions, 558 flow. Second operand 3 states and 864 transitions. [2025-03-08 22:07:35,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 265 transitions, 606 flow [2025-03-08 22:07:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:35,562 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 554 flow [2025-03-08 22:07:35,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2025-03-08 22:07:35,563 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -92 predicate places. [2025-03-08 22:07:35,563 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 554 flow [2025-03-08 22:07:35,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:35,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:35,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:35,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:07:35,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash -846093513, now seen corresponding path program 1 times [2025-03-08 22:07:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721821295] [2025-03-08 22:07:35,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:35,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 22:07:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 22:07:35,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:35,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721821295] [2025-03-08 22:07:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721821295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97018822] [2025-03-08 22:07:35,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:35,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:35,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:35,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-08 22:07:35,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:35,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:35,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-08 22:07:35,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:35,849 INFO L124 PetriNetUnfolderBase]: 758/1955 cut-off events. [2025-03-08 22:07:35,849 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-03-08 22:07:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1955 events. 758/1955 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11597 event pairs, 362 based on Foata normal form. 0/1765 useless extension candidates. Maximal degree in co-relation 3182. Up to 1026 conditions per place. [2025-03-08 22:07:35,858 INFO L140 encePairwiseOnDemand]: 375/381 looper letters, 28 selfloop transitions, 5 changer transitions 0/272 dead transitions. [2025-03-08 22:07:35,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 272 transitions, 638 flow [2025-03-08 22:07:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-03-08 22:07:35,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7629046369203849 [2025-03-08 22:07:35,860 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 554 flow. Second operand 3 states and 872 transitions. [2025-03-08 22:07:35,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 272 transitions, 638 flow [2025-03-08 22:07:35,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:35,864 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 582 flow [2025-03-08 22:07:35,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2025-03-08 22:07:35,864 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-08 22:07:35,864 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 582 flow [2025-03-08 22:07:35,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-08 22:07:35,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:35,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:07:35,865 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-08 22:07:35,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash -608414551, now seen corresponding path program 1 times [2025-03-08 22:07:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608677009] [2025-03-08 22:07:35,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:07:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:07:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:35,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:35,930 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-08 22:07:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608677009] [2025-03-08 22:07:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608677009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638682308] [2025-03-08 22:07:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:35,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:35,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:35,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 381 [2025-03-08 22:07:35,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-08 22:07:35,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:35,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 381 [2025-03-08 22:07:35,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:36,138 INFO L124 PetriNetUnfolderBase]: 758/1951 cut-off events. [2025-03-08 22:07:36,138 INFO L125 PetriNetUnfolderBase]: For 487/487 co-relation queries the response was YES. [2025-03-08 22:07:36,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1951 events. 758/1951 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11579 event pairs, 407 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 3460. Up to 1029 conditions per place. [2025-03-08 22:07:36,146 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 0 selfloop transitions, 0 changer transitions 267/267 dead transitions. [2025-03-08 22:07:36,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 267 transitions, 634 flow [2025-03-08 22:07:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-03-08 22:07:36,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7567804024496938 [2025-03-08 22:07:36,148 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 582 flow. Second operand 3 states and 865 transitions. [2025-03-08 22:07:36,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 267 transitions, 634 flow [2025-03-08 22:07:36,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:36,150 INFO L231 Difference]: Finished difference. Result has 271 places, 0 transitions, 0 flow [2025-03-08 22:07:36,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=271, PETRI_TRANSITIONS=0} [2025-03-08 22:07:36,151 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -90 predicate places. [2025-03-08 22:07:36,151 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 0 transitions, 0 flow [2025-03-08 22:07:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-08 22:07:36,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2025-03-08 22:07:36,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2025-03-08 22:07:36,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2025-03-08 22:07:36,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2025-03-08 22:07:36,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2025-03-08 22:07:36,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2025-03-08 22:07:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2025-03-08 22:07:36,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2025-03-08 22:07:36,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2025-03-08 22:07:36,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2025-03-08 22:07:36,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2025-03-08 22:07:36,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:07:36,164 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:36,170 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:07:36,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:07:36,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:07:36 BasicIcfg [2025-03-08 22:07:36,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:07:36,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:07:36,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:07:36,178 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:07:36,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:29" (3/4) ... [2025-03-08 22:07:36,179 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:07:36,181 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:07:36,181 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:07:36,181 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:07:36,182 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-08 22:07:36,187 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-08 22:07:36,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:07:36,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 22:07:36,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:07:36,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:07:36,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:07:36,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:07:36,252 INFO L158 Benchmark]: Toolchain (without parser) took 8048.04ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 112.1MB in the beginning and 220.9MB in the end (delta: -108.7MB). Peak memory consumption was 339.3MB. Max. memory is 16.1GB. [2025-03-08 22:07:36,252 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:36,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.42ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:07:36,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.20ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:36,253 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:36,253 INFO L158 Benchmark]: IcfgBuilder took 1157.93ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.1MB in the end (delta: 3.9MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-03-08 22:07:36,253 INFO L158 Benchmark]: TraceAbstraction took 6469.89ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 87.3MB in the beginning and 225.1MB in the end (delta: -137.7MB). Peak memory consumption was 307.3MB. Max. memory is 16.1GB. [2025-03-08 22:07:36,253 INFO L158 Benchmark]: Witness Printer took 74.19ms. Allocated memory is still 587.2MB. Free memory was 225.1MB in the beginning and 220.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:07:36,254 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.17ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.42ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.20ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1157.93ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.1MB in the end (delta: 3.9MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6469.89ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 87.3MB in the beginning and 225.1MB in the end (delta: -137.7MB). Peak memory consumption was 307.3MB. Max. memory is 16.1GB. * Witness Printer took 74.19ms. Allocated memory is still 587.2MB. Free memory was 225.1MB in the beginning and 220.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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 9 procedures, 475 locations, 491 edges, 163 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.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 929 IncrementalHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 63 mSDtfsCounter, 929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:07:36,269 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