./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_15-fldunknown_access.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/goblint-regression/05-lval_ls_15-fldunknown_access.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 a138099a172ffd618c200f98f002dd42af622d442f084454d63ab9b76b3cf563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:31,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:31,339 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:22:31,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:31,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:31,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:31,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:31,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:31,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:31,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:31,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:31,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:31,356 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:31,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:31,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:31,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:31,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:31,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:31,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:31,358 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 -> a138099a172ffd618c200f98f002dd42af622d442f084454d63ab9b76b3cf563 [2025-01-09 21:22:31,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:31,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:31,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:31,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:31,564 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:31,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_15-fldunknown_access.i [2025-01-09 21:22:32,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b67941c/8d193c92555142ea9112e32f86994183/FLAG397f7c6a9 [2025-01-09 21:22:32,985 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:32,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_15-fldunknown_access.i [2025-01-09 21:22:33,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b67941c/8d193c92555142ea9112e32f86994183/FLAG397f7c6a9 [2025-01-09 21:22:33,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b67941c/8d193c92555142ea9112e32f86994183 [2025-01-09 21:22:33,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:33,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:33,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:33,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:33,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:33,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0aa992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33, skipping insertion in model container [2025-01-09 21:22:33,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:33,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:33,561 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:33,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:33,636 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:33,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33 WrapperNode [2025-01-09 21:22:33,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:33,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:33,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:33,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:33,642 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:22:33" (1/1) ... [2025-01-09 21:22:33,650 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:22:33" (1/1) ... [2025-01-09 21:22:33,662 INFO L138 Inliner]: procedures = 261, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-01-09 21:22:33,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:33,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:33,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:33,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:33,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:33,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:33,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:33,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:33,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (1/1) ... [2025-01-09 21:22:33,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:33,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:33,703 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:22:33,708 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:22:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:33,733 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:22:33,867 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:33,871 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:33,979 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:33,980 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:33,986 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:33,986 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:33,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:33 BoogieIcfgContainer [2025-01-09 21:22:33,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:33,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:33,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:33,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:33,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:33" (1/3) ... [2025-01-09 21:22:33,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f641918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:33, skipping insertion in model container [2025-01-09 21:22:33,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:33" (2/3) ... [2025-01-09 21:22:33,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f641918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:33, skipping insertion in model container [2025-01-09 21:22:33,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:33" (3/3) ... [2025-01-09 21:22:33,995 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_15-fldunknown_access.i [2025-01-09 21:22:34,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:34,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_15-fldunknown_access.i that has 2 procedures, 70 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 21:22:34,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:34,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 70 transitions, 144 flow [2025-01-09 21:22:34,121 INFO L124 PetriNetUnfolderBase]: 1/69 cut-off events. [2025-01-09 21:22:34,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:34,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-01-09 21:22:34,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 70 transitions, 144 flow [2025-01-09 21:22:34,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 69 transitions, 141 flow [2025-01-09 21:22:34,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:34,149 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;@12f8cbf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:34,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:22:34,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:34,157 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2025-01-09 21:22:34,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:34,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:34,158 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] [2025-01-09 21:22:34,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -665811186, now seen corresponding path program 1 times [2025-01-09 21:22:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500171947] [2025-01-09 21:22:34,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:22:34,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:22:34,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:34,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:34,675 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:22:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:34,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500171947] [2025-01-09 21:22:34,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500171947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:34,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835523867] [2025-01-09 21:22:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:34,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:34,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:34,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 70 [2025-01-09 21:22:34,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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:22:34,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:34,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 70 [2025-01-09 21:22:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:34,920 INFO L124 PetriNetUnfolderBase]: 59/306 cut-off events. [2025-01-09 21:22:34,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:34,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 306 events. 59/306 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1413 event pairs, 20 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 420. Up to 110 conditions per place. [2025-01-09 21:22:34,923 INFO L140 encePairwiseOnDemand]: 59/70 looper letters, 16 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2025-01-09 21:22:34,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 259 flow [2025-01-09 21:22:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 357 transitions. [2025-01-09 21:22:34,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-01-09 21:22:34,937 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 141 flow. Second operand 6 states and 357 transitions. [2025-01-09 21:22:34,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 259 flow [2025-01-09 21:22:34,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:34,942 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 290 flow [2025-01-09 21:22:34,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2025-01-09 21:22:34,946 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 9 predicate places. [2025-01-09 21:22:34,946 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 290 flow [2025-01-09 21:22:34,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 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:22:34,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:34,947 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] [2025-01-09 21:22:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:34,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 941854793, now seen corresponding path program 1 times [2025-01-09 21:22:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184759396] [2025-01-09 21:22:34,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:34,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:22:34,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:22:34,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:34,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:35,139 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:22:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184759396] [2025-01-09 21:22:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184759396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:35,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259106312] [2025-01-09 21:22:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:35,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:35,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:35,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 70 [2025-01-09 21:22:35,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 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:22:35,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:35,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 70 [2025-01-09 21:22:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:35,364 INFO L124 PetriNetUnfolderBase]: 91/419 cut-off events. [2025-01-09 21:22:35,364 INFO L125 PetriNetUnfolderBase]: For 119/124 co-relation queries the response was YES. [2025-01-09 21:22:35,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 419 events. 91/419 cut-off events. For 119/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2258 event pairs, 24 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 759. Up to 173 conditions per place. [2025-01-09 21:22:35,366 INFO L140 encePairwiseOnDemand]: 59/70 looper letters, 33 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2025-01-09 21:22:35,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 468 flow [2025-01-09 21:22:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 337 transitions. [2025-01-09 21:22:35,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8023809523809524 [2025-01-09 21:22:35,370 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 290 flow. Second operand 6 states and 337 transitions. [2025-01-09 21:22:35,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 468 flow [2025-01-09 21:22:35,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:35,373 INFO L231 Difference]: Finished difference. Result has 91 places, 111 transitions, 474 flow [2025-01-09 21:22:35,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=91, PETRI_TRANSITIONS=111} [2025-01-09 21:22:35,374 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 19 predicate places. [2025-01-09 21:22:35,374 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 111 transitions, 474 flow [2025-01-09 21:22:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 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:22:35,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:35,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:35,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:35,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:35,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1446777837, now seen corresponding path program 1 times [2025-01-09 21:22:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586540368] [2025-01-09 21:22:35,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:35,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:22:35,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:22:35,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:35,663 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:22:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586540368] [2025-01-09 21:22:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586540368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72943535] [2025-01-09 21:22:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:35,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:35,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 70 [2025-01-09 21:22:35,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 111 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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:22:35,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:35,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 70 [2025-01-09 21:22:35,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:35,905 INFO L124 PetriNetUnfolderBase]: 197/698 cut-off events. [2025-01-09 21:22:35,906 INFO L125 PetriNetUnfolderBase]: For 456/470 co-relation queries the response was YES. [2025-01-09 21:22:35,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 698 events. 197/698 cut-off events. For 456/470 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4026 event pairs, 35 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 1694. Up to 352 conditions per place. [2025-01-09 21:22:35,910 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 58 selfloop transitions, 53 changer transitions 0/158 dead transitions. [2025-01-09 21:22:35,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 924 flow [2025-01-09 21:22:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-01-09 21:22:35,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-01-09 21:22:35,911 INFO L175 Difference]: Start difference. First operand has 91 places, 111 transitions, 474 flow. Second operand 6 states and 343 transitions. [2025-01-09 21:22:35,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 924 flow [2025-01-09 21:22:35,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 158 transitions, 924 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:35,919 INFO L231 Difference]: Finished difference. Result has 101 places, 158 transitions, 956 flow [2025-01-09 21:22:35,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=101, PETRI_TRANSITIONS=158} [2025-01-09 21:22:35,920 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 29 predicate places. [2025-01-09 21:22:35,920 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 158 transitions, 956 flow [2025-01-09 21:22:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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:22:35,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:35,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:35,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:35,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:35,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1623437392, now seen corresponding path program 1 times [2025-01-09 21:22:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:35,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670328613] [2025-01-09 21:22:35,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:35,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:22:35,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:22:35,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:35,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:36,125 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:22:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670328613] [2025-01-09 21:22:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670328613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053802008] [2025-01-09 21:22:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:36,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:36,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:36,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:36,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 70 [2025-01-09 21:22:36,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 158 transitions, 956 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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:22:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 70 [2025-01-09 21:22:36,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:36,390 INFO L124 PetriNetUnfolderBase]: 308/969 cut-off events. [2025-01-09 21:22:36,390 INFO L125 PetriNetUnfolderBase]: For 1322/1355 co-relation queries the response was YES. [2025-01-09 21:22:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 969 events. 308/969 cut-off events. For 1322/1355 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6077 event pairs, 49 based on Foata normal form. 3/944 useless extension candidates. Maximal degree in co-relation 2939. Up to 515 conditions per place. [2025-01-09 21:22:36,398 INFO L140 encePairwiseOnDemand]: 55/70 looper letters, 99 selfloop transitions, 61 changer transitions 6/211 dead transitions. [2025-01-09 21:22:36,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 211 transitions, 1618 flow [2025-01-09 21:22:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2025-01-09 21:22:36,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2025-01-09 21:22:36,402 INFO L175 Difference]: Start difference. First operand has 101 places, 158 transitions, 956 flow. Second operand 6 states and 323 transitions. [2025-01-09 21:22:36,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 211 transitions, 1618 flow [2025-01-09 21:22:36,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 211 transitions, 1554 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:36,416 INFO L231 Difference]: Finished difference. Result has 111 places, 205 transitions, 1478 flow [2025-01-09 21:22:36,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1478, PETRI_PLACES=111, PETRI_TRANSITIONS=205} [2025-01-09 21:22:36,417 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 39 predicate places. [2025-01-09 21:22:36,417 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 205 transitions, 1478 flow [2025-01-09 21:22:36,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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:22:36,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:36,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:36,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:36,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash 728113247, now seen corresponding path program 1 times [2025-01-09 21:22:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375570361] [2025-01-09 21:22:36,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:36,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:22:36,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:22:36,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:36,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:22:36,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:22:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:22:36,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:36,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:36,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:22:36,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:22:36,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:22:36,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:22:36,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:36,471 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:22:36,512 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:22:36,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:22:36,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:22:36 BasicIcfg [2025-01-09 21:22:36,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:22:36,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:22:36,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:22:36,522 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:22:36,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:33" (3/4) ... [2025-01-09 21:22:36,524 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:22:36,560 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-01-09 21:22:36,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:22:36,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:22:36,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:22:36,591 INFO L158 Benchmark]: Toolchain (without parser) took 3343.75ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 107.9MB in the end (delta: 49.3MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:36,591 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:36,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.71ms. Allocated memory is still 201.3MB. Free memory was 156.7MB in the beginning and 130.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:36,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 128.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:36,592 INFO L158 Benchmark]: Boogie Preprocessor took 14.52ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 126.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:36,592 INFO L158 Benchmark]: RCFGBuilder took 309.11ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 113.0MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:36,592 INFO L158 Benchmark]: TraceAbstraction took 2533.82ms. Allocated memory is still 201.3MB. Free memory was 112.6MB in the beginning and 116.2MB in the end (delta: -3.7MB). Peak memory consumption was 854.7kB. Max. memory is 16.1GB. [2025-01-09 21:22:36,592 INFO L158 Benchmark]: Witness Printer took 68.38ms. Allocated memory is still 201.3MB. Free memory was 116.2MB in the beginning and 107.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:36,593 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.18ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.71ms. Allocated memory is still 201.3MB. Free memory was 156.7MB in the beginning and 130.2MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 201.3MB. Free memory was 130.2MB in the beginning and 128.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.52ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 126.9MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 309.11ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 113.0MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2533.82ms. Allocated memory is still 201.3MB. Free memory was 112.6MB in the beginning and 116.2MB in the end (delta: -3.7MB). Peak memory consumption was 854.7kB. Max. memory is 16.1GB. * Witness Printer took 68.38ms. Allocated memory is still 201.3MB. Free memory was 116.2MB in the beginning and 107.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 932]: Data race detected Data race detected The following path leads to a data race: [L918-L921] 0 struct { int x; int y; } data; VAL [data={1:0}] [L927] 0 int *i,j = __VERIFIER_nondet_int(); VAL [data={1:0}] [L927] 0 int *i,j = __VERIFIER_nondet_int(); VAL [data={1:0}, j=1] [L928] 0 pthread_t id; VAL [data={1:0}, j=1] [L929] COND TRUE 0 \read(j) VAL [data={1:0}, j=1] [L929] 0 i = &data.x VAL [data={1:0}, i={1:0}, j=1] [L931] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L932] EXPR 0 \read(*i) VAL [\old(arg)={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L932] 0 (*i)++ VAL [\old(arg)={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L923] EXPR 1 data.x VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L923] 1 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L932] 0 (*i)++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L923] 1 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L932] 0 (*i)++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L923] 1 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L932] 0 (*i)++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i={1:0}, id=-1, j=1] [L923] 1 data.x++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L932] 0 (*i)++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i={1:0}, id=-1, j=1] Now there is a data race (on the heap) between C: data.x++ [923] and C: (*i)++ [932] - UnprovableResult [Line: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 3 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1478occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:22:36,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)