./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/sigma.i --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/pthread/sigma.i -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 236a73c15e935747b9f2e95e881c26c921eba2f2ad7a2b23cf05552665b9f683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:02:34,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:02:34,505 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:02:34,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:02:34,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:02:34,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:02:34,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:02:34,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:02:34,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:02:34,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:02:34,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:02:34,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:02:34,540 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:02:34,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:02:34,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:02:34,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:02:34,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:02:34,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:02:34,543 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:02:34,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:34,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:34,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:02:34,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:02:34,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:02:34,545 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 -> 236a73c15e935747b9f2e95e881c26c921eba2f2ad7a2b23cf05552665b9f683 [2025-01-09 21:02:34,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:02:34,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:02:34,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:02:34,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:02:34,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:02:34,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/sigma.i [2025-01-09 21:02:36,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a650d3e93/8b94b654f8d1495483db212373a57513/FLAGefea9c7a4 [2025-01-09 21:02:36,580 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:02:36,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/sigma.i [2025-01-09 21:02:36,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a650d3e93/8b94b654f8d1495483db212373a57513/FLAGefea9c7a4 [2025-01-09 21:02:36,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a650d3e93/8b94b654f8d1495483db212373a57513 [2025-01-09 21:02:36,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:02:36,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:02:36,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:36,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:02:36,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:02:36,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:36" (1/1) ... [2025-01-09 21:02:36,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4928f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:36, skipping insertion in model container [2025-01-09 21:02:36,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:36" (1/1) ... [2025-01-09 21:02:36,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:02:37,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:37,099 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:02:37,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:37,230 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:02:37,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37 WrapperNode [2025-01-09 21:02:37,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:37,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:37,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:02:37,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:02:37,240 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:02:37" (1/1) ... [2025-01-09 21:02:37,264 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:02:37" (1/1) ... [2025-01-09 21:02:37,295 INFO L138 Inliner]: procedures = 320, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 127 [2025-01-09 21:02:37,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:37,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:02:37,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:02:37,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:02:37,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:02:37,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:02:37,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:02:37,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:02:37,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (1/1) ... [2025-01-09 21:02:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:02:37,390 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:02:37,394 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:02:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:02:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:02:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:02:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:02:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:02:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:02:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:02:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:02:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:02:37,421 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:02:37,556 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:02:37,558 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:02:37,905 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:02:37,905 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:02:37,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:02:37,920 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:02:37,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:37 BoogieIcfgContainer [2025-01-09 21:02:37,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:02:37,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:02:37,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:02:37,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:02:37,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:36" (1/3) ... [2025-01-09 21:02:37,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a271d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:37, skipping insertion in model container [2025-01-09 21:02:37,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:37" (2/3) ... [2025-01-09 21:02:37,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a271d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:37, skipping insertion in model container [2025-01-09 21:02:37,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:37" (3/3) ... [2025-01-09 21:02:37,932 INFO L128 eAbstractionObserver]: Analyzing ICFG sigma.i [2025-01-09 21:02:37,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:02:37,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sigma.i that has 2 procedures, 165 locations, 1 initial locations, 3 loop locations, and 17 error locations. [2025-01-09 21:02:37,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:02:38,035 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:02:38,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 174 transitions, 355 flow [2025-01-09 21:02:38,177 INFO L124 PetriNetUnfolderBase]: 15/258 cut-off events. [2025-01-09 21:02:38,180 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:02:38,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 15/258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 583 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2025-01-09 21:02:38,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 174 transitions, 355 flow [2025-01-09 21:02:38,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 174 transitions, 355 flow [2025-01-09 21:02:38,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:38,220 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;@708b13cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:38,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:02:38,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:38,230 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:02:38,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:38,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:38,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:38,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1054951456, now seen corresponding path program 1 times [2025-01-09 21:02:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596321223] [2025-01-09 21:02:38,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:38,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:02:38,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:02:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:38,454 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:02:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596321223] [2025-01-09 21:02:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596321223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:38,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:38,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764381420] [2025-01-09 21:02:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:38,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:38,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:38,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:38,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2025-01-09 21:02:38,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 174 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:02:38,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:38,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2025-01-09 21:02:38,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:38,635 INFO L124 PetriNetUnfolderBase]: 3/232 cut-off events. [2025-01-09 21:02:38,639 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:02:38,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 232 events. 3/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 6/211 useless extension candidates. Maximal degree in co-relation 140. Up to 22 conditions per place. [2025-01-09 21:02:38,642 INFO L140 encePairwiseOnDemand]: 160/174 looper letters, 13 selfloop transitions, 1 changer transitions 2/159 dead transitions. [2025-01-09 21:02:38,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 353 flow [2025-01-09 21:02:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-01-09 21:02:38,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8908045977011494 [2025-01-09 21:02:38,667 INFO L175 Difference]: Start difference. First operand has 168 places, 174 transitions, 355 flow. Second operand 3 states and 465 transitions. [2025-01-09 21:02:38,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 353 flow [2025-01-09 21:02:38,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:38,679 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 323 flow [2025-01-09 21:02:38,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-01-09 21:02:38,686 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -6 predicate places. [2025-01-09 21:02:38,686 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 323 flow [2025-01-09 21:02:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:02:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:38,687 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] [2025-01-09 21:02:38,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:02:38,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:38,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 87353562, now seen corresponding path program 1 times [2025-01-09 21:02:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226767123] [2025-01-09 21:02:38,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:38,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:02:38,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:02:38,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:38,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:38,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226767123] [2025-01-09 21:02:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226767123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925591312] [2025-01-09 21:02:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:38,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:38,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:38,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:38,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 174 [2025-01-09 21:02:38,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:02:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:38,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 174 [2025-01-09 21:02:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:38,889 INFO L124 PetriNetUnfolderBase]: 5/265 cut-off events. [2025-01-09 21:02:38,890 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:02:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 265 events. 5/265 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 572 event pairs, 2 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 261. Up to 16 conditions per place. [2025-01-09 21:02:38,892 INFO L140 encePairwiseOnDemand]: 171/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-01-09 21:02:38,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 343 flow [2025-01-09 21:02:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:38,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-01-09 21:02:38,897 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 323 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:38,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 343 flow [2025-01-09 21:02:38,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:38,903 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 324 flow [2025-01-09 21:02:38,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2025-01-09 21:02:38,904 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -8 predicate places. [2025-01-09 21:02:38,904 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 324 flow [2025-01-09 21:02:38,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:02:38,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:38,905 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] [2025-01-09 21:02:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:38,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1571737649, now seen corresponding path program 1 times [2025-01-09 21:02:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367813112] [2025-01-09 21:02:38,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:38,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:02:38,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:02:38,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:38,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,023 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:02:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367813112] [2025-01-09 21:02:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367813112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812964817] [2025-01-09 21:02:39,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 174 [2025-01-09 21:02:39,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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:02:39,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 174 [2025-01-09 21:02:39,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,132 INFO L124 PetriNetUnfolderBase]: 7/261 cut-off events. [2025-01-09 21:02:39,133 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-01-09 21:02:39,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 261 events. 7/261 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 616 event pairs, 4 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 262. Up to 18 conditions per place. [2025-01-09 21:02:39,134 INFO L140 encePairwiseOnDemand]: 170/174 looper letters, 8 selfloop transitions, 1 changer transitions 0/153 dead transitions. [2025-01-09 21:02:39,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 336 flow [2025-01-09 21:02:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:39,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-01-09 21:02:39,137 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 324 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:39,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 336 flow [2025-01-09 21:02:39,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:39,141 INFO L231 Difference]: Finished difference. Result has 157 places, 153 transitions, 316 flow [2025-01-09 21:02:39,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=157, PETRI_TRANSITIONS=153} [2025-01-09 21:02:39,142 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -11 predicate places. [2025-01-09 21:02:39,142 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 316 flow [2025-01-09 21:02:39,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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:02:39,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:39,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:39,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:39,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2016037581, now seen corresponding path program 1 times [2025-01-09 21:02:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144222847] [2025-01-09 21:02:39,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:02:39,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:02:39,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,242 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:02:39,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144222847] [2025-01-09 21:02:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144222847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829050042] [2025-01-09 21:02:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 174 [2025-01-09 21:02:39,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:02:39,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 174 [2025-01-09 21:02:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,323 INFO L124 PetriNetUnfolderBase]: 8/345 cut-off events. [2025-01-09 21:02:39,323 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-09 21:02:39,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 345 events. 8/345 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1051 event pairs, 2 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 350. Up to 18 conditions per place. [2025-01-09 21:02:39,325 INFO L140 encePairwiseOnDemand]: 168/174 looper letters, 7 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2025-01-09 21:02:39,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 155 transitions, 342 flow [2025-01-09 21:02:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-01-09 21:02:39,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272030651340997 [2025-01-09 21:02:39,327 INFO L175 Difference]: Start difference. First operand has 157 places, 153 transitions, 316 flow. Second operand 3 states and 484 transitions. [2025-01-09 21:02:39,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 155 transitions, 342 flow [2025-01-09 21:02:39,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 155 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:39,335 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 343 flow [2025-01-09 21:02:39,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2025-01-09 21:02:39,338 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -9 predicate places. [2025-01-09 21:02:39,339 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 343 flow [2025-01-09 21:02:39,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:02:39,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,339 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:02:39,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:39,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1510520246, now seen corresponding path program 1 times [2025-01-09 21:02:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911054541] [2025-01-09 21:02:39,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:02:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:02:39,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,417 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:02:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911054541] [2025-01-09 21:02:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911054541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687152489] [2025-01-09 21:02:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 174 [2025-01-09 21:02:39,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:02:39,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 174 [2025-01-09 21:02:39,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,516 INFO L124 PetriNetUnfolderBase]: 9/396 cut-off events. [2025-01-09 21:02:39,516 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2025-01-09 21:02:39,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 396 events. 9/396 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1396 event pairs, 2 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 449. Up to 29 conditions per place. [2025-01-09 21:02:39,520 INFO L140 encePairwiseOnDemand]: 169/174 looper letters, 12 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-01-09 21:02:39,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 385 flow [2025-01-09 21:02:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-01-09 21:02:39,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9195402298850575 [2025-01-09 21:02:39,523 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 343 flow. Second operand 3 states and 480 transitions. [2025-01-09 21:02:39,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 385 flow [2025-01-09 21:02:39,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:39,529 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 367 flow [2025-01-09 21:02:39,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-01-09 21:02:39,531 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -7 predicate places. [2025-01-09 21:02:39,532 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 367 flow [2025-01-09 21:02:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:02:39,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,533 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] [2025-01-09 21:02:39,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:39,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1165677203, now seen corresponding path program 1 times [2025-01-09 21:02:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784881189] [2025-01-09 21:02:39,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:02:39,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:02:39,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,733 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:02:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784881189] [2025-01-09 21:02:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784881189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:02:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040376393] [2025-01-09 21:02:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:02:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:02:39,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:02:39,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 174 [2025-01-09 21:02:39,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 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:02:39,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 174 [2025-01-09 21:02:39,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,919 INFO L124 PetriNetUnfolderBase]: 5/284 cut-off events. [2025-01-09 21:02:39,919 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:02:39,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 284 events. 5/284 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 797 event pairs, 0 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 329. Up to 15 conditions per place. [2025-01-09 21:02:39,920 INFO L140 encePairwiseOnDemand]: 167/174 looper letters, 8 selfloop transitions, 5 changer transitions 16/158 dead transitions. [2025-01-09 21:02:39,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 397 flow [2025-01-09 21:02:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:02:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:02:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 621 transitions. [2025-01-09 21:02:39,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922413793103449 [2025-01-09 21:02:39,927 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 367 flow. Second operand 4 states and 621 transitions. [2025-01-09 21:02:39,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 158 transitions, 397 flow [2025-01-09 21:02:39,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 158 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:39,935 INFO L231 Difference]: Finished difference. Result has 163 places, 142 transitions, 345 flow [2025-01-09 21:02:39,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=163, PETRI_TRANSITIONS=142} [2025-01-09 21:02:39,940 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -5 predicate places. [2025-01-09 21:02:39,940 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 345 flow [2025-01-09 21:02:39,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 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:02:39,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,941 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] [2025-01-09 21:02:39,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:02:39,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:39,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash 679733083, now seen corresponding path program 1 times [2025-01-09 21:02:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403393143] [2025-01-09 21:02:39,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:02:39,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:02:39,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:40,579 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:02:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403393143] [2025-01-09 21:02:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403393143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:40,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:40,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292374471] [2025-01-09 21:02:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:40,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:40,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:40,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 174 [2025-01-09 21:02:40,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 142 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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:02:40,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:40,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 174 [2025-01-09 21:02:40,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:41,025 INFO L124 PetriNetUnfolderBase]: 124/612 cut-off events. [2025-01-09 21:02:41,025 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:02:41,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 612 events. 124/612 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3068 event pairs, 42 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 973. Up to 253 conditions per place. [2025-01-09 21:02:41,029 INFO L140 encePairwiseOnDemand]: 163/174 looper letters, 32 selfloop transitions, 22 changer transitions 0/163 dead transitions. [2025-01-09 21:02:41,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 495 flow [2025-01-09 21:02:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:02:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:02:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2025-01-09 21:02:41,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8113026819923371 [2025-01-09 21:02:41,032 INFO L175 Difference]: Start difference. First operand has 163 places, 142 transitions, 345 flow. Second operand 6 states and 847 transitions. [2025-01-09 21:02:41,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 495 flow [2025-01-09 21:02:41,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 163 transitions, 485 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:02:41,036 INFO L231 Difference]: Finished difference. Result has 154 places, 163 transitions, 485 flow [2025-01-09 21:02:41,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=154, PETRI_TRANSITIONS=163} [2025-01-09 21:02:41,037 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -14 predicate places. [2025-01-09 21:02:41,037 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 163 transitions, 485 flow [2025-01-09 21:02:41,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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:02:41,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:41,038 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] [2025-01-09 21:02:41,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:02:41,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1176670630, now seen corresponding path program 1 times [2025-01-09 21:02:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742665651] [2025-01-09 21:02:41,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:41,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:02:41,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:02:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:41,567 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:02:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742665651] [2025-01-09 21:02:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742665651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:41,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:41,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999867147] [2025-01-09 21:02:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:41,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:41,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:41,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:41,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2025-01-09 21:02:41,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 163 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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:02:41,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:41,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2025-01-09 21:02:41,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:41,917 INFO L124 PetriNetUnfolderBase]: 226/882 cut-off events. [2025-01-09 21:02:41,918 INFO L125 PetriNetUnfolderBase]: For 277/324 co-relation queries the response was YES. [2025-01-09 21:02:41,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 882 events. 226/882 cut-off events. For 277/324 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5086 event pairs, 27 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 2013. Up to 404 conditions per place. [2025-01-09 21:02:41,923 INFO L140 encePairwiseOnDemand]: 158/174 looper letters, 40 selfloop transitions, 52 changer transitions 0/210 dead transitions. [2025-01-09 21:02:41,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 210 transitions, 833 flow [2025-01-09 21:02:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:02:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:02:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 908 transitions. [2025-01-09 21:02:41,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8697318007662835 [2025-01-09 21:02:41,926 INFO L175 Difference]: Start difference. First operand has 154 places, 163 transitions, 485 flow. Second operand 6 states and 908 transitions. [2025-01-09 21:02:41,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 210 transitions, 833 flow [2025-01-09 21:02:41,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 210 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:41,937 INFO L231 Difference]: Finished difference. Result has 164 places, 210 transitions, 899 flow [2025-01-09 21:02:41,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=899, PETRI_PLACES=164, PETRI_TRANSITIONS=210} [2025-01-09 21:02:41,938 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -4 predicate places. [2025-01-09 21:02:41,940 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 210 transitions, 899 flow [2025-01-09 21:02:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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:02:41,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:41,941 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:02:41,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:41,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash -38862407, now seen corresponding path program 1 times [2025-01-09 21:02:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12159021] [2025-01-09 21:02:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:41,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:02:41,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:02:41,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:41,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12159021] [2025-01-09 21:02:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12159021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:02:42,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127786948] [2025-01-09 21:02:42,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:42,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:42,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:42,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:42,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 174 [2025-01-09 21:02:42,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 210 transitions, 899 flow. Second operand has 6 states, 6 states have (on average 150.66666666666666) internal successors, (904), 6 states have internal predecessors, (904), 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:02:42,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:42,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 174 [2025-01-09 21:02:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:42,404 INFO L124 PetriNetUnfolderBase]: 163/692 cut-off events. [2025-01-09 21:02:42,404 INFO L125 PetriNetUnfolderBase]: For 532/583 co-relation queries the response was YES. [2025-01-09 21:02:42,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 692 events. 163/692 cut-off events. For 532/583 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3818 event pairs, 7 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 1801. Up to 144 conditions per place. [2025-01-09 21:02:42,412 INFO L140 encePairwiseOnDemand]: 168/174 looper letters, 3 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-01-09 21:02:42,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 157 transitions, 728 flow [2025-01-09 21:02:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:02:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:02:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2025-01-09 21:02:42,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8637110016420362 [2025-01-09 21:02:42,416 INFO L175 Difference]: Start difference. First operand has 164 places, 210 transitions, 899 flow. Second operand 7 states and 1052 transitions. [2025-01-09 21:02:42,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 157 transitions, 728 flow [2025-01-09 21:02:42,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 157 transitions, 708 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:42,428 INFO L231 Difference]: Finished difference. Result has 134 places, 157 transitions, 702 flow [2025-01-09 21:02:42,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=702, PETRI_PLACES=134, PETRI_TRANSITIONS=157} [2025-01-09 21:02:42,430 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, -34 predicate places. [2025-01-09 21:02:42,430 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 157 transitions, 702 flow [2025-01-09 21:02:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.66666666666666) internal successors, (904), 6 states have internal predecessors, (904), 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:02:42,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:42,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:02:42,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:02:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -262766830, now seen corresponding path program 1 times [2025-01-09 21:02:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230779892] [2025-01-09 21:02:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:42,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:02:42,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:02:42,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:42,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:42,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:02:42,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:02:42,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:02:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:42,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:02:42,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:02:42,531 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-01-09 21:02:42,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-01-09 21:02:42,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:02:42,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:02:42,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:02:42,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:02:42,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:02:42,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:02:42,537 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:42,598 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:02:42,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:02:42,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:02:42 BasicIcfg [2025-01-09 21:02:42,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:02:42,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:02:42,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:02:42,607 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:02:42,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:37" (3/4) ... [2025-01-09 21:02:42,608 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:02:42,676 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:02:42,723 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:02:42,723 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:02:42,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:02:42,724 INFO L158 Benchmark]: Toolchain (without parser) took 6095.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.2MB in the beginning and 106.7MB in the end (delta: 4.5MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-01-09 21:02:42,724 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:42,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.09ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 78.6MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:02:42,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.77ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:42,725 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 74.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:42,725 INFO L158 Benchmark]: RCFGBuilder took 571.70ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 55.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:02:42,725 INFO L158 Benchmark]: TraceAbstraction took 4682.70ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 54.8MB in the beginning and 116.2MB in the end (delta: -61.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:42,725 INFO L158 Benchmark]: Witness Printer took 116.41ms. Allocated memory is still 176.2MB. Free memory was 116.2MB in the beginning and 106.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:42,726 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.36ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.09ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 78.6MB in the end (delta: 32.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.77ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 75.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 74.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 571.70ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 55.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4682.70ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 54.8MB in the beginning and 116.2MB in the end (delta: -61.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 116.41ms. Allocated memory is still 176.2MB. Free memory was 116.2MB in the beginning and 106.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1117]: Data race detected Data race detected The following path leads to a data race: [L1112] 0 const int SIGMA = 16; VAL [SIGMA=16] [L1113] 0 int *array; VAL [SIGMA=16, array={0:0}] [L1114] 0 int array_index=-1; VAL [SIGMA=16, array={0:0}, array_index=-1] [L1122] 0 int tid, sum; VAL [SIGMA=16, array={0:0}, array_index=-1] [L1123] 0 pthread_t *t; VAL [SIGMA=16, array={0:0}, array_index=-1] [L1124] EXPR 0 sizeof(pthread_t) * SIGMA VAL [SIGMA=16, array={0:0}, array_index=-1] [L1124] 0 t = (pthread_t *)malloc(sizeof(pthread_t) * SIGMA) VAL [SIGMA=16, array={0:0}, array_index=-1, t={10:0}] [L1125] EXPR 0 sizeof(int) * SIGMA VAL [SIGMA=16, array={0:0}, array_index=-1, t={10:0}] [L1125] 0 array = (int *)malloc(sizeof(int) * SIGMA) VAL [SIGMA=16, array={9:0}, array_index=-1, t={10:0}] [L1126] CALL 0 assume_abort_if_not(t) [L11] COND FALSE 0 !(!cond) VAL [SIGMA=16, \old(cond)=10, array={9:0}, array_index=-1, cond=10] [L1126] RET 0 assume_abort_if_not(t) [L1127] 0 assume_abort_if_not(array) [L1127] CALL 0 assume_abort_if_not(array) [L11] COND FALSE 0 !(!cond) VAL [SIGMA=16, \old(cond)=9, array={9:0}, array_index=-1, cond=9] [L1127] RET 0 assume_abort_if_not(array) [L1128] 0 tid=0 VAL [SIGMA=16, array={9:0}, array_index=-1, t={10:0}, tid=0] [L1128] 0 tid