./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:31:18,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:31:18,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:31:18,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:31:18,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:31:18,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:31:18,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:31:18,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:31:18,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:31:18,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:31:18,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:31:18,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:31:18,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:31:18,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:31:18,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:31:18,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:31:18,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:18,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:18,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:18,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:31:18,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:18,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:31:18,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:31:18,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:31:18,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:31:18,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:31:18,281 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-jdk21/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 -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2025-01-09 21:31:18,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:31:18,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:31:18,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:31:18,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:31:18,533 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:31:18,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-01-09 21:31:19,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c024e32/eb2c81d4eb9348d4a96ec34e6487e89f/FLAGe3be65cdd [2025-01-09 21:31:20,097 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:31:20,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-01-09 21:31:20,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c024e32/eb2c81d4eb9348d4a96ec34e6487e89f/FLAGe3be65cdd [2025-01-09 21:31:20,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c024e32/eb2c81d4eb9348d4a96ec34e6487e89f [2025-01-09 21:31:20,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:31:20,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:31:20,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:20,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:31:20,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:31:20,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386270ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20, skipping insertion in model container [2025-01-09 21:31:20,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:31:20,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:20,353 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:31:20,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:20,393 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:31:20,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20 WrapperNode [2025-01-09 21:31:20,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:20,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:20,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:31:20,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:31:20,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,433 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-01-09 21:31:20,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:20,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:31:20,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:31:20,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:31:20,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:31:20,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:31:20,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:31:20,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:31:20,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (1/1) ... [2025-01-09 21:31:20,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:20,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:20,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:31:20,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:31:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:31:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:31:20,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:31:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:31:20,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:31:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:31:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:31:20,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:31:20,535 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:31:20,631 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:31:20,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:31:20,966 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:31:20,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:31:20,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:31:20,983 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:31:20,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:20 BoogieIcfgContainer [2025-01-09 21:31:20,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:31:20,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:31:20,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:31:20,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:31:20,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:31:20" (1/3) ... [2025-01-09 21:31:20,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e685cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:20, skipping insertion in model container [2025-01-09 21:31:20,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:20" (2/3) ... [2025-01-09 21:31:20,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e685cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:20, skipping insertion in model container [2025-01-09 21:31:20,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:20" (3/3) ... [2025-01-09 21:31:20,991 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2025-01-09 21:31:21,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:31:21,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-symm.wvr.c that has 3 procedures, 242 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-01-09 21:31:21,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:21,112 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:31:21,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 255 transitions, 524 flow [2025-01-09 21:31:21,250 INFO L124 PetriNetUnfolderBase]: 14/253 cut-off events. [2025-01-09 21:31:21,252 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:21,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 14/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2025-01-09 21:31:21,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 255 transitions, 524 flow [2025-01-09 21:31:21,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 233 transitions, 478 flow [2025-01-09 21:31:21,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:21,287 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;@bf4cf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:21,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-09 21:31:21,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:21,296 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:31:21,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:21,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:21,297 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] [2025-01-09 21:31:21,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1849191193, now seen corresponding path program 1 times [2025-01-09 21:31:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553443934] [2025-01-09 21:31:21,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:21,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:31:21,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:31:21,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:21,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553443934] [2025-01-09 21:31:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553443934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832403303] [2025-01-09 21:31:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:21,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:21,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:21,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:21,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 233 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:21,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:21,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:21,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:21,674 INFO L124 PetriNetUnfolderBase]: 17/407 cut-off events. [2025-01-09 21:31:21,674 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:31:21,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 407 events. 17/407 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1561 event pairs, 5 based on Foata normal form. 13/355 useless extension candidates. Maximal degree in co-relation 317. Up to 21 conditions per place. [2025-01-09 21:31:21,681 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 10 selfloop transitions, 2 changer transitions 2/226 dead transitions. [2025-01-09 21:31:21,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 488 flow [2025-01-09 21:31:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-01-09 21:31:21,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-01-09 21:31:21,702 INFO L175 Difference]: Start difference. First operand has 228 places, 233 transitions, 478 flow. Second operand 3 states and 718 transitions. [2025-01-09 21:31:21,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 488 flow [2025-01-09 21:31:21,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 480 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:31:21,715 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 456 flow [2025-01-09 21:31:21,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-01-09 21:31:21,721 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-01-09 21:31:21,722 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 456 flow [2025-01-09 21:31:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:21,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:21,723 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] [2025-01-09 21:31:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:21,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -947320442, now seen corresponding path program 1 times [2025-01-09 21:31:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867008575] [2025-01-09 21:31:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:31:21,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:31:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867008575] [2025-01-09 21:31:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867008575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069419491] [2025-01-09 21:31:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:21,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:21,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:21,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:21,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-01-09 21:31:21,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:21,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:21,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-01-09 21:31:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:21,891 INFO L124 PetriNetUnfolderBase]: 12/329 cut-off events. [2025-01-09 21:31:21,891 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:31:21,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 329 events. 12/329 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 943 event pairs, 3 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 325. Up to 17 conditions per place. [2025-01-09 21:31:21,894 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-01-09 21:31:21,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 476 flow [2025-01-09 21:31:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-01-09 21:31:21,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-01-09 21:31:21,899 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 456 flow. Second operand 3 states and 714 transitions. [2025-01-09 21:31:21,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 476 flow [2025-01-09 21:31:21,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:21,908 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 454 flow [2025-01-09 21:31:21,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2025-01-09 21:31:21,911 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -6 predicate places. [2025-01-09 21:31:21,911 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 454 flow [2025-01-09 21:31:21,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:21,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:21,912 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] [2025-01-09 21:31:21,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:21,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:21,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 42739571, now seen corresponding path program 1 times [2025-01-09 21:31:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058796921] [2025-01-09 21:31:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:31:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:31:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058796921] [2025-01-09 21:31:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058796921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457442979] [2025-01-09 21:31:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:21,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:21,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:22,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:22,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,072 INFO L124 PetriNetUnfolderBase]: 15/334 cut-off events. [2025-01-09 21:31:22,073 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:22,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 334 events. 15/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1102 event pairs, 5 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 327. Up to 21 conditions per place. [2025-01-09 21:31:22,076 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-01-09 21:31:22,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 476 flow [2025-01-09 21:31:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-01-09 21:31:22,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.930718954248366 [2025-01-09 21:31:22,079 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 454 flow. Second operand 3 states and 712 transitions. [2025-01-09 21:31:22,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 476 flow [2025-01-09 21:31:22,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:22,084 INFO L231 Difference]: Finished difference. Result has 221 places, 222 transitions, 452 flow [2025-01-09 21:31:22,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=222} [2025-01-09 21:31:22,086 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -7 predicate places. [2025-01-09 21:31:22,086 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 222 transitions, 452 flow [2025-01-09 21:31:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,087 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] [2025-01-09 21:31:22,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:22,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 939753265, now seen corresponding path program 1 times [2025-01-09 21:31:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580259332] [2025-01-09 21:31:22,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:31:22,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:31:22,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580259332] [2025-01-09 21:31:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580259332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674552938] [2025-01-09 21:31:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-01-09 21:31:22,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:22,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-01-09 21:31:22,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,256 INFO L124 PetriNetUnfolderBase]: 12/330 cut-off events. [2025-01-09 21:31:22,256 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:31:22,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 330 events. 12/330 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 954 event pairs, 3 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 310. Up to 17 conditions per place. [2025-01-09 21:31:22,258 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-01-09 21:31:22,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 472 flow [2025-01-09 21:31:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-01-09 21:31:22,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-01-09 21:31:22,261 INFO L175 Difference]: Start difference. First operand has 221 places, 222 transitions, 452 flow. Second operand 3 states and 714 transitions. [2025-01-09 21:31:22,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 221 transitions, 472 flow [2025-01-09 21:31:22,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:22,266 INFO L231 Difference]: Finished difference. Result has 220 places, 221 transitions, 450 flow [2025-01-09 21:31:22,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2025-01-09 21:31:22,267 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-01-09 21:31:22,267 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 450 flow [2025-01-09 21:31:22,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:22,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,268 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-01-09 21:31:22,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:22,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1325343806, now seen corresponding path program 1 times [2025-01-09 21:31:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156937063] [2025-01-09 21:31:22,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:31:22,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:31:22,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156937063] [2025-01-09 21:31:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156937063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823237803] [2025-01-09 21:31:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:22,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:22,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,442 INFO L124 PetriNetUnfolderBase]: 32/560 cut-off events. [2025-01-09 21:31:22,442 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:31:22,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 560 events. 32/560 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2686 event pairs, 9 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 554. Up to 36 conditions per place. [2025-01-09 21:31:22,446 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-01-09 21:31:22,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 222 transitions, 483 flow [2025-01-09 21:31:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-01-09 21:31:22,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-01-09 21:31:22,449 INFO L175 Difference]: Start difference. First operand has 220 places, 221 transitions, 450 flow. Second operand 3 states and 717 transitions. [2025-01-09 21:31:22,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 222 transitions, 483 flow [2025-01-09 21:31:22,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:22,456 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 461 flow [2025-01-09 21:31:22,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-01-09 21:31:22,458 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-01-09 21:31:22,459 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 461 flow [2025-01-09 21:31:22,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,460 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] [2025-01-09 21:31:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:22,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 317624442, now seen corresponding path program 1 times [2025-01-09 21:31:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140155450] [2025-01-09 21:31:22,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:31:22,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:31:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140155450] [2025-01-09 21:31:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140155450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237568196] [2025-01-09 21:31:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:22,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,604 INFO L124 PetriNetUnfolderBase]: 34/573 cut-off events. [2025-01-09 21:31:22,604 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-01-09 21:31:22,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 573 events. 34/573 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2883 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. [2025-01-09 21:31:22,607 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-01-09 21:31:22,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 494 flow [2025-01-09 21:31:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-01-09 21:31:22,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-01-09 21:31:22,610 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 461 flow. Second operand 3 states and 717 transitions. [2025-01-09 21:31:22,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 222 transitions, 494 flow [2025-01-09 21:31:22,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:22,615 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 476 flow [2025-01-09 21:31:22,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-01-09 21:31:22,617 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-01-09 21:31:22,618 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 476 flow [2025-01-09 21:31:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,618 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] [2025-01-09 21:31:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:22,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 567017611, now seen corresponding path program 1 times [2025-01-09 21:31:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993189722] [2025-01-09 21:31:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:31:22,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:31:22,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,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-01-09 21:31:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993189722] [2025-01-09 21:31:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993189722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437301212] [2025-01-09 21:31:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-01-09 21:31:22,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-01-09 21:31:22,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-01-09 21:31:22,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,790 INFO L124 PetriNetUnfolderBase]: 25/689 cut-off events. [2025-01-09 21:31:22,791 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:31:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 689 events. 25/689 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3462 event pairs, 2 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 623. Up to 32 conditions per place. [2025-01-09 21:31:22,795 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-01-09 21:31:22,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 513 flow [2025-01-09 21:31:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-01-09 21:31:22,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-01-09 21:31:22,799 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 476 flow. Second operand 3 states and 724 transitions. [2025-01-09 21:31:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 513 flow [2025-01-09 21:31:22,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 224 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:22,804 INFO L231 Difference]: Finished difference. Result has 219 places, 221 transitions, 486 flow [2025-01-09 21:31:22,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=219, PETRI_TRANSITIONS=221} [2025-01-09 21:31:22,805 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-01-09 21:31:22,805 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 221 transitions, 486 flow [2025-01-09 21:31:22,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-01-09 21:31:22,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,807 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-01-09 21:31:22,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:22,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1048582861, now seen corresponding path program 1 times [2025-01-09 21:31:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108156920] [2025-01-09 21:31:22,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:31:22,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:31:22,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108156920] [2025-01-09 21:31:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108156920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687869111] [2025-01-09 21:31:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-01-09 21:31:22,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 221 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-01-09 21:31:22,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-01-09 21:31:22,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,936 INFO L124 PetriNetUnfolderBase]: 26/630 cut-off events. [2025-01-09 21:31:22,936 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-01-09 21:31:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 630 events. 26/630 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3003 event pairs, 4 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 591. Up to 25 conditions per place. [2025-01-09 21:31:22,940 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-01-09 21:31:22,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 221 transitions, 511 flow [2025-01-09 21:31:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-01-09 21:31:22,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-01-09 21:31:22,943 INFO L175 Difference]: Start difference. First operand has 219 places, 221 transitions, 486 flow. Second operand 3 states and 718 transitions. [2025-01-09 21:31:22,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 221 transitions, 511 flow [2025-01-09 21:31:22,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:22,946 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 488 flow [2025-01-09 21:31:22,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2025-01-09 21:31:22,950 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-01-09 21:31:22,950 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 488 flow [2025-01-09 21:31:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-01-09 21:31:22,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,951 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-01-09 21:31:22,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:22,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -556902577, now seen corresponding path program 1 times [2025-01-09 21:31:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651675695] [2025-01-09 21:31:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:31:22,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:31:22,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651675695] [2025-01-09 21:31:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651675695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767618666] [2025-01-09 21:31:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:23,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:23,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-01-09 21:31:23,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-01-09 21:31:23,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:23,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-01-09 21:31:23,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:23,106 INFO L124 PetriNetUnfolderBase]: 26/722 cut-off events. [2025-01-09 21:31:23,106 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:31:23,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 722 events. 26/722 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3772 event pairs, 4 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 681. Up to 33 conditions per place. [2025-01-09 21:31:23,110 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-01-09 21:31:23,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 223 transitions, 525 flow [2025-01-09 21:31:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-01-09 21:31:23,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-01-09 21:31:23,113 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 488 flow. Second operand 3 states and 724 transitions. [2025-01-09 21:31:23,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 223 transitions, 525 flow [2025-01-09 21:31:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 223 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:23,117 INFO L231 Difference]: Finished difference. Result has 219 places, 220 transitions, 494 flow [2025-01-09 21:31:23,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2025-01-09 21:31:23,118 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-01-09 21:31:23,118 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 494 flow [2025-01-09 21:31:23,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-01-09 21:31:23,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:23,119 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] [2025-01-09 21:31:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:31:23,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:23,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash 304350489, now seen corresponding path program 1 times [2025-01-09 21:31:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908342047] [2025-01-09 21:31:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:31:23,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:31:23,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:23,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908342047] [2025-01-09 21:31:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908342047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:23,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:23,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092899197] [2025-01-09 21:31:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:23,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:23,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:23,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:23,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-01-09 21:31:23,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-01-09 21:31:23,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:23,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-01-09 21:31:23,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:23,252 INFO L124 PetriNetUnfolderBase]: 33/577 cut-off events. [2025-01-09 21:31:23,252 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-01-09 21:31:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 577 events. 33/577 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2632 event pairs, 4 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 569. Up to 47 conditions per place. [2025-01-09 21:31:23,255 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-01-09 21:31:23,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 220 transitions, 519 flow [2025-01-09 21:31:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-01-09 21:31:23,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-01-09 21:31:23,258 INFO L175 Difference]: Start difference. First operand has 219 places, 220 transitions, 494 flow. Second operand 3 states and 718 transitions. [2025-01-09 21:31:23,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 220 transitions, 519 flow [2025-01-09 21:31:23,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:23,261 INFO L231 Difference]: Finished difference. Result has 220 places, 219 transitions, 496 flow [2025-01-09 21:31:23,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=220, PETRI_TRANSITIONS=219} [2025-01-09 21:31:23,262 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-01-09 21:31:23,262 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 496 flow [2025-01-09 21:31:23,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-01-09 21:31:23,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:23,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:31:23,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:23,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1684243623, now seen corresponding path program 1 times [2025-01-09 21:31:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908510261] [2025-01-09 21:31:23,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:23,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:31:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:31:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908510261] [2025-01-09 21:31:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908510261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:23,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:23,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184346631] [2025-01-09 21:31:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:23,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:23,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:23,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:23,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:23,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:23,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:23,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:23,429 INFO L124 PetriNetUnfolderBase]: 21/625 cut-off events. [2025-01-09 21:31:23,430 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:31:23,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 625 events. 21/625 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2930 event pairs, 2 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 605. Up to 18 conditions per place. [2025-01-09 21:31:23,433 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 10 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2025-01-09 21:31:23,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 512 flow [2025-01-09 21:31:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-01-09 21:31:23,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320261437908497 [2025-01-09 21:31:23,436 INFO L175 Difference]: Start difference. First operand has 220 places, 219 transitions, 496 flow. Second operand 3 states and 713 transitions. [2025-01-09 21:31:23,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 512 flow [2025-01-09 21:31:23,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:23,440 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 488 flow [2025-01-09 21:31:23,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-01-09 21:31:23,441 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2025-01-09 21:31:23,441 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 488 flow [2025-01-09 21:31:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:23,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:23,442 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] [2025-01-09 21:31:23,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:31:23,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:31:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1306588128, now seen corresponding path program 1 times [2025-01-09 21:31:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045300814] [2025-01-09 21:31:23,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:23,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:31:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:31:23,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045300814] [2025-01-09 21:31:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045300814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232151762] [2025-01-09 21:31:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:23,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:23,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:23,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:23,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-01-09 21:31:23,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:23,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:23,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-01-09 21:31:23,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:23,591 INFO L124 PetriNetUnfolderBase]: 23/596 cut-off events. [2025-01-09 21:31:23,592 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-01-09 21:31:23,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 596 events. 23/596 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2505 event pairs, 2 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 556. Up to 25 conditions per place. [2025-01-09 21:31:23,595 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 0 selfloop transitions, 0 changer transitions 215/215 dead transitions. [2025-01-09 21:31:23,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 215 transitions, 510 flow [2025-01-09 21:31:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-01-09 21:31:23,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-01-09 21:31:23,598 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 488 flow. Second operand 3 states and 714 transitions. [2025-01-09 21:31:23,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 215 transitions, 510 flow [2025-01-09 21:31:23,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:23,601 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2025-01-09 21:31:23,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=215, PETRI_TRANSITIONS=0} [2025-01-09 21:31:23,602 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -13 predicate places. [2025-01-09 21:31:23,602 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2025-01-09 21:31:23,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-01-09 21:31:23,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-01-09 21:31:23,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-01-09 21:31:23,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-01-09 21:31:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:31:23,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:23,616 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:23,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:23,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:23 BasicIcfg [2025-01-09 21:31:23,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:23,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:23,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:23,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:23,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:20" (3/4) ... [2025-01-09 21:31:23,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:23,628 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:23,628 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:23,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:31:23,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:23,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:23,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:23,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:23,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:23,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:23,717 INFO L158 Benchmark]: Toolchain (without parser) took 3572.97ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 86.8MB in the end (delta: 25.0MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-01-09 21:31:23,718 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:23,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.95ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 99.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:23,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.87ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:23,720 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 97.1MB in the end (delta: 814.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:23,720 INFO L158 Benchmark]: RCFGBuilder took 510.60ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 77.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:31:23,720 INFO L158 Benchmark]: TraceAbstraction took 2636.72ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 92.9MB in the end (delta: -15.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-01-09 21:31:23,720 INFO L158 Benchmark]: Witness Printer took 93.75ms. Allocated memory is still 176.2MB. Free memory was 92.9MB in the beginning and 86.8MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:23,721 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.32ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.95ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 99.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.87ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 97.1MB in the end (delta: 814.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 510.60ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 77.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2636.72ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 92.9MB in the end (delta: -15.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 93.75ms. Allocated memory is still 176.2MB. Free memory was 92.9MB in the beginning and 86.8MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 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: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 360 locations, 36 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: 2.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 71 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:23,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE